Computing the branchwidth of interval graphs

Authors:
Ton Kloks;Jan Kratochvíl;Haiko Müller
Affiliations:
Department of Mathematics and Computer Science, Vrije Universiteit, 1081 HV Amsterdam, The Netherlands;Department of Applied Mathematics, Institute for Theoretical Computer Science, Charles University, Malostranské nám. 25, 118 00 Praha 1, Czech Republic;Fakultät für Mathematik und Informatik, Friedrich-Schiller-Universität Jena, 07740 Jena, Germany
Venue:
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Year:
2005

Citing 11
Cited 2

Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Graph algorithms

Handbook of theoretical computer science (vol. A)
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Upper bounds on the size of obstructions and intertwines

Journal of Combinatorial Theory Series B
Graphs with branchwidth at most three

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Treewidth and Minimum Fill-in: Grouping the Minimal Separators

SIAM Journal on Computing
Constructive Linear Time Algorithms for Branchwidth

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
New branchwidth territories

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Computing branchwidth via efficient triangulations and blocks

Discrete Applied Mathematics
Branchwidth of chordal graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Branchwidth is a graph invariant closely related to treewidth, but exhibiting remarkable distinctions. E.g., branchwidth is known to be computable in polynomial time for planar graphs. Our results concern the computational complexity of determining the branchwidth of graphs in several classes. We give an algorithm computing the branchwidth of interval graphs in time O(n3 log n). This method generalizes to permutation graphs and, more generally, to trapezoid graphs. In contrast, we show that computing branchwidth is NP-complete for splitgraphs and for bipartite graphs.