Empirical study on branchwidth and branch decomposition of planar graphs

Proceedings of the 10th Workshop on Algorithm Engineering and Experiments and the 5th Workshop on Analytic Algorithmics and Combinatorics

Volumn , Issue , 2008, Pages 152-165

  Bian, Zhengbing ^a   Gu, Qian Ping ^a   Marzban, Marjan ^a   Tainaki, Hisao ^b   Yoshitake, Yumi ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b MEIJI UNIVERSITY   (Japan)

Author keywords

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

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY;

ALGORITHM ENGINEERING; BRANCH DECOMPOSITION; BRANCHWIDTH; COMPUTATIONAL STUDIES; EFFICIENT IMPLEMENTATION; EMPIRICAL STUDIES; GRAPH ALGORITHMS; MEMORY SPACE; PLANAR GRAPH; THOMAS ALGORITHM;

GRAPHIC METHODS;

EID: 45449112076     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972887.15     Document Type: Conference Paper

References (24)

1. Public Implementation of a Graph Algorithm Library and Editor, 2007. http://pigale.sourceforge.net/.
2. The LEDA User Manual, Algorithmic Solutions, Version 4.2.1, 2007. http://www.mpi-inf.rnpg.de/LEDA/MANUAL/MANUAL.html.
3. S. Arnborg, D.G. Corneil, and A. Proskurowski. Complexity of finding embedding in a k-tree. SIAM J. on Discrete Mathematics, 8:277-284, 1987.
4. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12:308-340, 1991.
5. Z. Bian, Q.P. Gu, M. Marzban, H. Tamaki, and Y. Yoshitake. Empirical study on branchwidth and branch decomposition of planar graphs. Technical Report, SFU-CMPT-TR 2007-22, School of Computing Science, Simon Fraser University, 2007.
6. H.L. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11:1-21, 1993.
7. H.L. Bodlaender. A linear time algorithm for finding tree-decomposition of small treewidth. SIAM J. on Computing, 25:1305-1317, 1996.
8. H.L. Bodlaender. Treewidth: characterizations, applications, and computations. In Proc. of 32nd Workshop on Graph Theoretical Concepts in Computer Science (WG2006), LNCS 4271, pages 1-14, 2006.
9. H.L. Bodlaender and D. Thilikos. Constructive linear time algorithm for branchwidth. In Proc. of 24th International Colloquium on Automata, Languages, and Programming, ICALP'97, pages 627-637, 1997.
10. F. Dorn, E. Penninkx, H. Bodlaender, and F.V. Fomin. Efficient exact algorithms for planar graphs: exploiting sphere cut branch decompositions. In Proc. of the 13th Annual European Symposium on Algorithms (ESA05), LNCS 3669, pages 95-106, 2005.
11. F.V. Fomin and D.M. Thilikos. Dominating sets in planar graphs: branch-width and exponential speed-up. SIAM Journal on Computing, 36(2):281-309, 2006.
12. 3) time. In Proc. of 32nd International Colloquium on Automata, Languages, and Programming, ICALP2005, LNCS3580, pages 373-384, 2005.
13. I.V. Hicks. Planar branch decompositions I: The ratcatcher. INFORMS Journal on Computing, 17(4):402-412, 2005.
14. I.V. Hicks. Planar branch decompositions II: The cycle method. INFORMS Journal on Computing, 17(4):413-421, 2005.
15. I.V. Hicks, A.M.C.A. Koster, and E. Kolotoǧlu. Branch and tree decomposition techniques for discrete optimization. In TutORials in Operation Research: INFORMS-New Orleans 2005, pages 1-29, 2005.
16. K. Mehlhorn and S. Näher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, New York, 1999.
17. G. Reinelt. TSPLIB-A traveling salesman library. ORSA J. on Computing, 3:376-384, 1991.
18. N. Robertson and P.D. Seymour. Graph minors I. Excluding a forest. Journal of Combinatorial Theory, Series B, 35:39-61, 1983.
19. N. Robertson and P.D. Seymour. Graph minors II. Algorithmic aspects of tree-width. Journal of Algorithms, 7:309-322, 1986.
20. N. Robertson and P.D. Seymour. Graph minors X. Obstructions to tree decomposition. J. of Combinatorial Theory, Series B, 52:153-190, 1991.
21. G. Schaeffer. Random sampling of large planar maps and convex polyhedra. In Proc. of the 31st Annual ACM Symposium on the Theory of Computing (STOC'99), pages 760-769, 1999.
22. P.D. Seymour and R. Thomas. Call routing and the ratcatcher. Combinatorial, 14(2):217-241, 1994.
23. H. Tamaki. A linear time heuristic for the branch-decomposition of planar graphs. In Proc. of ESA2003, pages 765-775, 2003.
24. D.B. West. Introduction to Graph Theory. Prentice Hall Inc., Upper Saddle River, NJ, 1996.