Chapter

STACS 99

Volume 1563 of the series Lecture Notes in Computer Science pp 173-183

Date:

New Branchwidth Territories

  • Ton KloksAffiliated withDepartment of Mathematics and Computer Science, Vrije Universiteit
  • , Jan KratochvílAffiliated withDepartment of Applied Mathematics and DIMATIA, Charles University
  • , Haiko MüllerAffiliated withFakultät für Mathematik und Informatik, Friedrich-Schiller-Universität Jena

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We give an algorithm computing the branchwidth of interval graphs in time O(n 3 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.