New branchwidth territories

Authors:
Ton Kloks;Jan Kratochvíl;Haiko Müller
Affiliations:
Department of Mathematics and Computer Science, Vrije Universiteit, Amsterdam, The Netherlands;Department of Applied Mathematics and DIMATIA Charles University, Praha 1, Czech Republic;Friedrich-Schiller-Universität Jena, Fakultät für Mathematik und Informatik, Jena, Germany
Venue:
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Year:
1999

Citing 3
Cited 8

Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Constructive Linear Time Algorithms for Branchwidth

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming

Computing the branchwidth of interval graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Planar Branch Decompositions I: The Ratcatcher

INFORMS Journal on Computing
Branchwidth of chordal graphs

Discrete Applied Mathematics
NP-hard and linear variants of hypergraph partitioning

Theoretical Computer Science
Computing the branchwidth of interval graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
New tools and simpler algorithms for branchwidth

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Computing branchwidth via efficient triangulations and blocks

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
The branch-width of circular-arc graphs

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

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.