AAAI Publications, Twenty-First International Joint Conference on Artificial Intelligence

Font Size: 
Combining Breadth-First and Depth-First Strategies in Searching for Treewidth
Rong Zhou, Eric A. Hansen

Last modified: 2009-06-25


Breadth-first and depth-first search are basic search strategies upon which many other search algorithms are built. In this paper, we describe an approach to integrating these two strategies in a single algorithm that combines the complementary strengths of both. We show the benefits of this approach using the treewidth problem as an example.


heuristic search

Full Text: PDF