Combining Breadth-First and Depth-First Strategies in Searching for Treewidth

Contents

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.