Rong Zhou, Eric A. Hansen
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 report preliminary computationl results using the treewidth problem as an example.
Subjects: 15.7 Search; 15. Problem Solving
Submitted: May 6, 2008