Abstract
We generalize the concept of tree-width to directed graphs and prove that every directed graph with no "haven" of large order has small tree-width. Conversely, a digraph with a large haven has large tree-width. We also show that the Hamilton cycle problem and other NP-hard problems can be solved in polynomial time when restricted to digraphs of bounded tree-width.
Original language | English (US) |
---|---|
Pages (from-to) | 138-154 |
Number of pages | 17 |
Journal | Journal of Combinatorial Theory. Series B |
Volume | 82 |
Issue number | 1 |
DOIs | |
State | Published - May 2001 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics