Title of article
Directed Tree-Width
Author/Authors
Johnson، نويسنده , , Thor and Robertson، نويسنده , , Neil and Seymour، نويسنده , , P.D. and THOMAS، نويسنده , , Robin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
17
From page
138
To page
154
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.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2001
Journal title
Journal of Combinatorial Theory Series B
Record number
1526825
Link To Document