Generation of graphs with bounded branchwidth

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

Volumn 4271 LNCS, Issue , 2006, Pages 205-216

  Paul, Christophe ^a   Proskurowski, Andrzej ^b   Telle, Jan Arne ^a,c  

^a LIRMM   (France)

^b UNIVERSITY OF OREGON   (United States)

^c UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; EDGE DETECTION; SET THEORY;

BRANCHWIDTH; CONNECTIVITY PARAMETERS; MAXIMAL GRAPHS; TREEWIDTH;

TREES (MATHEMATICS);

EID: 33845540318     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11917496_19     Document Type: Conference Paper

References (18)

1. H.L. Bodlaender, T. Kloks and D. Kratsch. Treewidth and pathwidth of permutation graphs. SIAM J. Computing, 25:1305-1317, 1996.
2. H.L. Bodlaender. Treewidth: Algorithmic techniques and results. In 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS). Vol. 1295 of Lecture Notes in Computer Science, p. 19-36, 1997.
3. H.L. Bodlaender and D.M. Thilikos. Graphs with branchwidth at most three. Journal of Algorithms, 32:167-194, 1999.
4. W. Cook and P.D. Seymour. Tour merging via branch-decompositions. Journal on Computing, 15:233-248, 2003.
5. E. Demaine, F. Fomin, M. Hajiaghayi, and D.M. Thilikos. Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs. In 30th Int. Colloquium on Automata, Languages, and Programming (ICALP). Vol. 2719 of Lecture Notes in Computer Science, p. 829-844, 2003.
6. F. Dorn, E. Penninkx, H.L. Bodlaender and F.V. Fomin. Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. In 13th European Symposium on Algorithm (ESA). Vol. 3669 of Lecture Notes in Computer Science, p. 95-106, 2005.
7. F. Fomin and D.M. Thilikos. Dominating sets in planar graphs: Branch-width and exponential speedup. In 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), p. 168-177, 2003.
8. F. Fomin and D.M. Thilikos. A simple and fast approach for solving problems on planar graphs. In 22nd Annual Symposium on Theoretical Aspect of Computer Science (STAGS) Vol. 2996 of Lecture Notes in Computer Science, p. 56-67, 2004.
9. F. Fomin and D. Thilikos. Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speedup. In 31st International Colloquium on Automata, Languages, and Programming (ICALP), Vol. 3142 of Lecture Notes in Computer Science, p. 581-592, 2004.
10. F. Fomin, F. Mazoit and I. Todinca. Computing branchwidth via efficient triangulation and blocks. In 31st Workshop on Graph Theoretic Concepts in Computer Science (WG), Vol. 3787 of Lecture Notes in Computer Science, p. 374-384, 2005.
11. T. Kloks, J. Kratochvil, and H. Müller. New branchwidth territories. Discrete Applied Mathematics. 145:266-275, 2005.
12. J. Kleinberg and E. Tardos. Algorithm design. Addison-Wesley, 2005.
13. C. Paul and J.A. Telle. Edge-maximal graphs of branchwidth k. In International Conference on Graph Theory - ICGT. Vol. 23 Electronic Notes in Discrete Mathematics, 363-368, 2005.
14. C. Paul and A. Proskurowski and J.A. Telle. Algorithm generation of graphs of branchwidht ≤ k. LIRMM Technical report number RR-05047. 2005.
15. C. Paul and J.A. Telle. New tools and simpler algorithms for branchwidth. In 13th European Symposium on Algorithm (ESA). Vol. 3669 of Lecture Notes in Computer Science, p. 379-390, 2005.
16. B. Reed. Treewidth and tangles, a new measure of connectivity and some applications. In Surveys in Combinatorics. Vol. 241 of London Mathematical Society Lecture Note Series Cambridge University Press, 1997.
17. N. Robertson and P.D. Seymour. Graph minors X: Obstructions to tree-decomposition. Journal on Combinatorial Theory Series B, 52:153-190, 1991.
18. D. Rose. On simple characterization of k-trees. Discrete Mathematics, 7:317-322, 1974.