ML Anthology

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

Rong Zhou, Eric A. Hansen
IJCAI 2009 pp. 640-645
/ijcai/2009/zhou2009ijcai-combining/

Abstract

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. Rong Zhou, Eric A. Hansen

PDF Semantic Scholar

Cite

Text

Zhou and Hansen. "Combining Breadth-First and Depth-First Strategies in Searching for Treewidth." International Joint Conference on Artificial Intelligence, 2009.

Markdown

[Zhou and Hansen. "Combining Breadth-First and Depth-First Strategies in Searching for Treewidth." International Joint Conference on Artificial Intelligence, 2009.](https://mlanthology.org/ijcai/2009/zhou2009ijcai-combining/)

BibTeX

@inproceedings{zhou2009ijcai-combining,
  title     = {{Combining Breadth-First and Depth-First Strategies in Searching for Treewidth}},
  author    = {Zhou, Rong and Hansen, Eric A.},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2009},
  pages     = {640-645},
  url       = {https://mlanthology.org/ijcai/2009/zhou2009ijcai-combining/}
}