A combinatorial optimization algorithm for solving the branchwidth problem

Authors:
J. Cole Smith;Elif Ulusal;Illya V. Hicks
Affiliations:
Industrial & Systems Engineering, University of Florida, Gainesville, USA;Mathematics, Houston Community College, Houston, USA;Computational & Applied Mathematics, Rice University, Houston, USA
Venue:
Computational Optimization and Applications
Year:
2012

Citing 11
Cited 1

The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete

SIAM Journal on Algebraic and Discrete Methods
The monadic second-order logic of graphs. I. recognizable sets of finite graphs

Information and Computation
Easy problems for tree-decomposable graphs

Journal of Algorithms
Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Tour Merging via Branch-Decomposition

INFORMS Journal on Computing
Branch decompositions and minor containment

Networks
Graphs, branchwidth, and tangles! Oh my!

Networks
Planar Branch Decompositions II: The Cycle Method

INFORMS Journal on Computing
On exact algorithms for treewidth

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Computing branchwidth via efficient triangulations and blocks

Discrete Applied Mathematics

A SAT approach to clique-width

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.