A combinatorial optimization algorithm for solving the branchwidth problem
- 99 Downloads
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.
KeywordsBranch decomposition Branchwidth Implicit enumeration Partitioning
Unable to display preview. Download preview PDF.
- 2.Bian, Z., Gu, Q., Marzban, M., Tamaki, H., Yoshitake, Y.: Empirical study on branchwidth and branch decomposition of planar graphs. In: Proceedings of the 2008 SIAM Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 152–165. SIAM, Philadelphia (2008) Google Scholar
- 3.Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D., Thilikos, D.M.: On exact algorithms for treewidth. In: Proceedings of the 14th Annual European Symposium on Algorithms (ESA 2006). Lecture Notes in Computer Science, vol. 4168, pp. 672–683. Springer, Berlin (2006) Google Scholar
- 5.Cook, W.J., Seymour, P.D.: An algorithm for the ring-router problem. Technical report, Bellcore (1994) Google Scholar
- 8.Fomin, F.V., Thilikos, D.M.: A simple and fast approach for solving problems on planar graphs. In: Lecture Notes in Computer Science, vol. 2996, pp. 56–67. Springer, Berlin (2004) Google Scholar
- 9.Fomin, F.V., Fraigniaud, P., Thilikos, D.M.: The price of connectedness in expansions. Technical Report 273, Department of Informatics, University of Bergen, Bergen, Norway, May 2004 Google Scholar