---
title: "Combining Breadth-First and Depth-First Strategies in Searching for Treewidth"
authors:
  - "Rong Zhou"
  - "Eric A. Hansen"
doi: ""
url: "https://ijcai.org/proceedings/2009/112"
pdf: "https://ijcai.org/proceedings/2009/0112.pdf"
venue: "Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence"
year: 2009
pages: "640-644"
track: ""
keywords:
---

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

Rong Zhou, Eric A. Hansen

*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