New Branchwidth Territories

  • Ton Kloks
  • Jan Kratochvíl
  • Haiko Müller
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1563)

Abstract

We give an algorithm computing the branchwidth of interval graphs in time O(n3 log n). This method generalizes to permutation graphs and, more generaly, to trapezoid graphs. In contrast, we show that computing branchwidth is NP-complete for splitgraphs and bipartite graphs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bodlaender, H. and D. M. Thilikos, Constructive linear time algorithms for branch-width, Proceedings ICALP’97, Springer-Verlag, LNCS 1256, (1997), pp. 627–637.Google Scholar
  2. 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.MATHMathSciNetGoogle Scholar
  3. 3.
    Garey, M.R. and D. S. Johnson, Computers and intractability, a guide to the theory of NP-completeness, Freeman, San Francisco 1979.MATHGoogle Scholar
  4. 4.
    Kloks, T., Treewidth-Computations and Approximations, Springer-Verlag, LNCS 842, 1994.MATHGoogle Scholar
  5. 5.
    Robertson, N. and P.D. Seymour, Graph minors X: Obstructions to tree-decomposition, Journal of Combinatorial Theory, Series B 52, (1991), pp. 153–190.MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Seymour, P.D. and R. Thomas, Call routing and the ratcatcher, Combinatorica 14, (1994), pp. 217–241.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Ton Kloks
    • 1
  • Jan Kratochvíl
    • 2
  • Haiko Müller
    • 3
  1. 1.Department of Mathematics and Computer ScienceVrije UniversiteitAmsterdamThe Netherlands
  2. 2.Department of Applied Mathematics and DIMATIACharles UniversityPraha 1Czech Republic
  3. 3.Fakultät für Mathematik und InformatikFriedrich-Schiller-Universität JenaJenaGermany

Personalised recommendations