Best-first search for treewidth

Authors:
P. Alex Dow;Richard E. Korf
Affiliations:
Computer Science Department, University of California, Los Angeles, Los Angeles, CA;Computer Science Department, University of California, Los Angeles, Los Angeles, CA
Venue:
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Year:
2007

Citing 14
Cited 6

A heuristic search algorithm with modifiable estimate

Artificial Intelligence
Generalized best-first search strategies and the optimality of A*

Journal of the ACM (JACM)
Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Recursive conditioning

Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Memory-Bounded A* Graph Search

Proceedings of the Fifteenth International Florida Artificial Intelligence Research Society Conference
Pre-processing for Triangulation of Probabilistic Networks

UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Sweep A*: Space-Efficient Heuristic Search in Partially Ordered Graphs

ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
A complete anytime algorithm for treewidth

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Frontier search

Journal of the ACM (JACM)
Breadth-first heuristic search

Artificial Intelligence
On exact algorithms for treewidth

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Best-first frontier search with delayed duplicate detection

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Bucket elimination: a unifying framework for probabilistic inference

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Discovering treewidth

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science

Duplicate avoidance in depth-first search with applications to treewidth

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Combining breadth-first and depth-first strategies in searching for treewidth

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Exploiting the probability of observation for efficient bayesian network inference

Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
All roads lead to Rome---New search methods for the optimal triangulation problem

International Journal of Approximate Reasoning
Parameterized complexity results for exact bayesian network structure learning

Journal of Artificial Intelligence Research
A SAT approach to clique-width

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found by searching over the space of vertex elimination orders. This search space differs from those where best-first search is typically applied, because a solution path is evaluated by its maximum edge cost instead of the sum of its edge costs. We show how to make best-first search admissible on max-cost problem spaces. We also employ breadth-first heuristic search to reduce the memory requirement while still eliminating all duplicate nodes in the search space. Our empirical results show that our algorithms find the exact treewidth an order of magnitude faster than the previous state-of-the-art algorithm on hard benchmark graphs.