Login / Signup
A backtracking-based algorithm for hypertree decomposition.
Georg Gottlob
Marko Samer
Published in:
ACM J. Exp. Algorithmics (2008)
Keyphrases
</>
computational complexity
dynamic programming
optimal solution
search space
mathematical model
linear programming
convex hull
training data
bayesian networks
worst case
simulated annealing
constraint satisfaction
temporal reasoning
space complexity