Introducing Directed Tree Width

Electronic Notes in Discrete Mathematics

Volumn 3, Issue , 1999, Pages 222-229

  Reed, B ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33244472963     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/S1571-0653(05)80061-7     Document Type: Article

References (15)

1. Arnborg S., Corneil D.G., and Proskurowski A. Complexity of finding embeddings in a k-tree. SIAM Journal on Algebraic and Discrete Methods 8 (1987) 277-284
2. Reed B. Tree width and tangles, a new measure of connectivity and some applications. In: Bailey R. (Ed). Surveys in Combinatorics (1997), Cambridge University Press, Cambridge UK
3. Johnson, T. N.Robertson, P.D. Seymour and R. Thomas, Directed Tree Width, manuscript
4. H. L. Bodlaender, A linear time algorithm for finding tree decompositions of small treewidth, Proceedings of the 25th Annual Association for Computing Machinery Symposium on Theory of Computing, (ACM Press, New York, 1993) 226-234.
5. R. Diestel, T. Jensen, I. Gorbunov, and C. Thomassen, Highly Connected Sets and The Excluded Grid Theorem, manuscript
6. Lovász L., and Plummer M. Matching Theory (1986), North Holland, Amsterdam
7. Menger K. Zur allgemeinen Kurventheorie. Fundamenta Mathematicae 10 (1927) 96-115
8. Hu T.C. Integer Programming and Network Flows (1969), Addison-Wesley, Don Mills
9. B.Reed, N. Robertson, P. Seymour R. Thomas On packing directed circuits, Combinatorica
10. Robertson N., and Seymour P.D. Graph Minors. II. Algorithmic aspects of tree-width. Journal of Algorithms 7 (1986) 309-322
11. Robertson N., and Seymour P.D. Graph Minors. V. Excluding a planar graph. Journal of Combinatorial Theory, Series B 41 (1986) 92-114
12. Robertson N., and Seymour P.D. Graph Minors. X. Obstructions to treedecomposition. Journal of Combinatorial Theory, Series B 52 (1991) 153-190
13. Robertson N., and Seymour P.D. Graph Minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory, Series B 63 (1995) 65-110
14. Robertson N., Seymour P., and Thomas R. Quickly excluding a planar graph. Journal of Combinatorial Theory, Series B 62 (1994) 323-348
15. Seymour P.D., and Thomas R. Graph searching and a min-max theorem for tree-width. Journal of Combinatorial Theory 58 Series B (1993) 22-33