New tools and simpler algorithms for branchwidth

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 379-390

  Paul, Christophe ^a   Telle, Jan Arne ^b  

^a LIRMM   (France)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; NUMBER THEORY; POLYNOMIALS; SET THEORY; TREES (MATHEMATICS);

BRANCHWIDTH; CHORDAL GRAPHS; CLIQUE TREES; INTERVAL GRAPH;

ALGORITHMS;

EID: 27144462023     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_35     Document Type: Conference Paper

References (15)

1. H.L. Bodlaender and D.M. Thilikos. Constructive linear time algorithms for branchwidth. In 24th International Colloquium on Automata, Languages, and Programming (ICALP), Vol. 1256 of Lecture Notes in Computer Science, p. 627-637, 1997.
2. H.L. Bodlaender and D.M. Thilikos. Graphs with branchwidth at most three. Journal of Algorithms, 32:167-194, 1999.
3. K. Booth and G. Lueker. Testing of the consecutive ones property, interval graphs, and graph planarity testing using PQ-tree algorithms. Journal of Computer and System Sciences, 13:335-379, 1976.
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 International Colloquium on Automata, Languages, and Programming (ICALP). Vol. 2719 of Lecture Notes in Computer Science, p. 829-844, 2003.
6. F. Fomin and D. 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.
7. F. Fomin and D. 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.
8. 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.
9. F. Gavril. The intersection graphs of subtrees in trees are exactly the chordal graphs. Journal of Combinatorial Theory Series B, 16:47-56, 1974.
10. M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Acad. Press, 1980.
11. T. Kloks, J. Kratochvil, and H. Müller. New branchwidth territories. In 16th Ann. Symp. on Theoretical Aspect of Computer Science (STACS) Vol. 1563 of Lecture Notes in Computer Science, p. 173-183, 1999.
12. T. Kloks, J. Kratochvil, and H. Müller. Computing the branchwidth of interval graphs. Discrete Applied Mathematics 145:266-145, 2005.
13. F. Mazoit. A general scheme for deciding the branchwidth. Technical Report RR2004-34, LIP - École Normale Supérieure de Lyon, 2004. http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2004/RR2004-34.pdf.
14. N. Robertson and P.D. Seymour. Graph minors X: Obstructions to tree-decomposition. Journal on Combinatorial Theory Series B, 52:153-190, 1991.
15. P.D. Seymour and R. Thomas. Call routing and the ratcatcher. Combinatorica, 14(2):217-241, 1994.