New branchwidth territories

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1563, Issue , 1999, Pages 173-183

  Kloks, Ton ^a   Kratochvíl, Jan ^b   Müller, Haiko ^c  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b CHARLES UNIVERSITY   (Czech Republic)

^c FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

ALGORITHM COMPUTING; BIPARTITE GRAPHS; BRANCHWIDTH; INTERVAL GRAPH; NP COMPLETE; PERMUTATION GRAPH; TRAPEZOID GRAPHS;

GRAPH THEORY;

EID: 84957062748     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49116-3_16     Document Type: Conference Paper

References (6)

1. Bodlaender, H. and D. M. Thilikos, Constructive linear time algorithms for branchwidth, Proceedings ICALP'97, Springer-Verlag, LNCS 1256, (1997), pp. 627-637.
2. Booth, K. and G. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity testing using PQ-tree algorithms, J. of Computer and System Sciences 13, (1976), pp. 335-379.
3. Garey, M. R. and D. S. Johnson, Computers and intractability, a guide to the theory of NP-completeness, Freeman, San Francisco 1979.
4. Kloks, T., Treewidth-Computations and Approximations, Springer-Verlag, LNCS 842, 1994.
5. Robertson, N. and P. D. Seymour, Graph minors X: Obstructions to treedecomposition, Journal of Combinatorial Theory, Series B 52, (1991), pp. 153-190.
6. Seymour, P. D. and R. Thomas, Call routing and the ratcatcher, Combinatorica 14, (1994), pp. 217-241.