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

Zhou, Rong; Hansen, Eric A.

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

Download BibTeX Cite

Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 640-644.

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

Rong Zhou, and Eric A. Hansen. 2009. Combining Breadth-First and Depth-First Strategies in Searching for Treewidth. In Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09. IJCAI, 640–644. https://ijcai.org/proceedings/2009/112

@inproceedings{ijcai2009p112,
  title     = {Combining Breadth-First and Depth-First Strategies in Searching for Treewidth},
  author    = {Zhou, Rong and Hansen, Eric A.},
  booktitle = {Proceedings of the Twenty-First International Joint Conference on
               Artificial Intelligence, {IJCAI-09}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Hiroaki Kitano},
  pages     = {640--644},
  year      = {2009},
  url       = {https://ijcai.org/proceedings/2009/112},
}

TY  - CPAPER
TI  - Combining Breadth-First and Depth-First Strategies in Searching for Treewidth
AU  - Zhou, Rong
AU  - Hansen, Eric A.
T2  - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2009
SP  - 640
EP  - 644
UR  - https://ijcai.org/proceedings/2009/112
ER  -