A combinatorial optimization algorithm for solving the branchwidth problem

In this paper, we consider the problem of computing an optimal branch decomposition of a graph. Branch decompositions and branchwidth were introduced by Robertson and Seymour in their series of papers that proved the Graph Minors Theorem. Branch decompositions have proven to be useful in solving many NP-hard problems, such as the traveling salesman, independent set, and ring routing problems, by means of combinatorial algorithms that operate on branch decompositions. We develop an implicit enumeration algorithm for the optimal branch decomposition problem and examine its performance on a set of classical graph instances.

[1]  Arie M. C. A. Koster,et al.  Contraction and Treewidth Lower Bounds , 2004, ESA.

[2]  Illya V. Hicks,et al.  Branch decompositions and minor containment , 2004, Networks.

[3]  B. Mohar,et al.  Graph Minors , 2009 .

[4]  Paul D. Seymour,et al.  Tour Merging via Branch-Decomposition , 2003, INFORMS J. Comput..

[5]  Dimitrios M. Thilikos,et al.  A Simple and Fast Approach for Solving Problems on Planar Graphs , 2004, STACS.

[6]  Fedor V. Fomin,et al.  Computing branchwidth via efficient triangulations and blocks , 2009, Discret. Appl. Math..

[7]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[8]  Robin Thomas,et al.  Call routing and the ratcatcher , 1994, Comb..

[9]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[10]  Dimitrios M. Thilikos,et al.  On Exact Algorithms for Treewidth , 2006, ESA.

[11]  David S. Johnson,et al.  COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION , 1978 .

[12]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[13]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[14]  Hisao Tamaki,et al.  Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs , 2008, ALENEX.

[15]  B. Monien.  The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete , 1986 .

[16]  Illya V. Hicks.  Planar Branch Decompositions II: The Cycle Method , 2005, INFORMS J. Comput..

[17]  Pierre Fraigniaud,et al.  The price of connectedness in expansions , 2004 .

[18]  Illya V. Hicks.  Graphs, branchwidth, and tangles! Oh my! , 2005 .

[19]  Illya V. Hicks.  Graphs, branchwidth, and tangles! Oh my! , 2005, Networks.