Computing branch decomposition of large planar graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5038 LNCS, Issue , 2008, Pages 87-100

  Bian, Zhengbing ^a   Gu, Qian Ping ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Algorithm engineering; Branch decomposition; Computational study; Graph algorithms; Planar graphs

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; EVOLUTIONARY ALGORITHMS; GRAPH THEORY; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; NONLINEAR PROGRAMMING; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; SYSTEMS ENGINEERING;

BRANCH DECOMPOSITION; BRANCH WIDTH (MM); DYNAMIC PROGRAMMING (DP) ALGORITHMS; EXPERIMENTAL ALGORITHMS; INTERNATIONAL (CO); NP HARD PROBLEMS; OPTIMAL BRANCH-DECOMPOSITION; PLANAR GRAPHS; POLYNOMIAL-TIME;

INTEGER PROGRAMMING;

EID: 45449112954     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68552-4_7     Document Type: Conference Paper

References (23)

1. Public Implementation of a Graph Algorithm Library and Editor (2008), http://pigale.sourceforge.net/
2. The LEDA User Manual, Algorithmic Solutions, Version 4.2.1 (2008), http://www.mpi-inf.mpg.de/LEDA/MANUAL/MANUAL.html
3. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embedding in a k-tree. SIAM J. on Discrete Mathematics 8, 277-284 (1987)
4. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms 12, 308-340 (1991)
5. Bian, Z., Gu, Q., Marzban, M., Tamaki, H., Yoshitake, Y.: Empirical study on branchwidth and branch decomposition of planar graphs. In: Proc. of the 9th SIAM Workshop on Algorithm Engineering and Experiments (ALENEX 2008), pp. 152-165 (2008)
6. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11, 1-21 (1993)
7. Bodlaender, H.L.: A linear time algorithm for finding tree-decomposition of small treewidth. SIAM J. on Computing 25, 1305-1317 (1996)
8. Bodlaender, H.L.: Treewidth: Characterizations, applications, and computations. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 1-14. Springer, Heidelberg (2006)
9. Bodlaender, H.L., Thilikos, D.: Constructive linear time algorithm for branchwidth. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 627-637. Springer, Heidelberg (1997)
10. Dorn, F., Penninkx, E., Bodlaender, H., Fomin, F.V.: Efficient exact algorithms for planar graphs: Exploiting sphere cut branch decompositions. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 95-106. Springer, Heidelberg (2005)
11. Fomin, F.V., Thilikos, D.M.: Dominating sets in planar graphs: Branch-width and exponential speed-up. SIAM Journal on Computing 36(2), 281-309 (2006)
12. 3) time. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 373-384. Springer, Heidelberg (2005)
13. Hicks, I.V.: Branch decompositions and their applications. PhD Thesis, Rice University (2000)
14. Hicks, I.V.: Planar branch decompositions II: The cycle method. INFORMS Journal on Computing 17(4), 413-421 (2005)
15. Hicks, I.V., Koster, A.M.C.A., Kolotoǧlu, E.: Branch and tree decomposition techniques for discrete optimization. In: TutORials in Operation Research: INFORMS-New Orleans 2005, pp. 1-29 (2005)
16. Mehlhorn, K., Näher, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, New York (1999)
17. Reinelt, G.: TSPLIB-A traveling salesman library. ORSA J. on Computing 3, 376-384 (1991)
18. Robertson, N., Seymour, P.D.: Graph minors I. Excluding a forest. Journal of Combinatorial Theory, Series B 35, 39-61 (1983)
19. Robertson, N., Seymour, P.D.: Graph minors II. Algorithmic aspects of tree-width. Journal of Algorithms 7, 309-322 (1986)
20. Robertson, N., Seymour, P.D.: Graph minors X. Obstructions to tree decomposition. J. of Combinatorial Theory, Series B 52, 153-190 (1991)
21. Schaeffer, G.: Random sampling of large planar maps and convex polyhedra. In: Proc. of the 31st Annual ACM Symposium on the Theory of Computing (STOC 1999), pp. 760-769 (1999)
22. Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14(2), 217-241 (1994)
23. West, D.B.: Introduction to Graph Theory. Prentice Hall Inc., Upper Saddle River, NJ (1996)