{"type":"ScholarlyArticle","title":"Combining Breadth-First and Depth-First Strategies in Searching for Treewidth","authors":[{"name":"Rong Zhou","slug":"rong-zhou","given":"Rong","family":"Zhou","affiliation":""},{"name":"Eric A. Hansen","slug":"eric-a-hansen","given":"Eric A.","family":"Hansen","affiliation":""}],"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","doi":null,"url":"https://ijcai.org/proceedings/2009/112","pdf":"https://ijcai.org/proceedings/2009/0112.pdf","markdown":"https://ijcai.org/proceedings/2009/112.md","bibtex":"https://ijcai.org/proceedings/2009/bibtex/112","volume":{"slug":"2009","title":"Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2009","url":"https://ijcai.org/proceedings/2009/","year":2009,"location":"Pasadena, California, USA","dates":"","editors":"Hiroaki Kitano","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":112,"pages":{"first":640,"last":644},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}