A linear time heuristic for the branch-decomposition of planar graphs

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

Volumn 2832, Issue , 2003, Pages 765-775

  Tamaki, Hisao ^a  

^a MEIJI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; OPTIMIZATION;

BIPARTITE GRAPHS; BRANCH DECOMPOSITION; GENERAL GRAPH; LINEAR TIME; MAXIMUM DISTANCE; PLANAR DRAWING; PLANAR GRAPH; TEST INSTANCES;

GRAPH THEORY;

EID: 0142183752     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_68     Document Type: Article

References (12)

1. S. Arnborg and J. Lagergren and D. Seese, Easy problems for tree-decomposable graphs, Journal of Algorithms, 12, 308-340, 1991
2. H. Bodlaender, A tourist guide through treewidth, Acta Cybernetica, 11, 1-21, 1993.
3. W. Cook and P.D. Seymour, Tour merging via branch-decomposition, to appear in INFORMS Jounal on Computing, 2003
4. I.V. Hicks, Branch Decompositions and their applications, Phd thesis, Rice University, April, 2000.
5. N. Robertson and P.D. Seymour, Graph minors II. Algorithmic aspects of tree width, Journal of Algorithms, 7, 309-322, 1986
6. N. Robertson and P.D. Seymour, Graph minors X. Obstructions to treedecomposition, Journal of Combinatorial Theory, Series B, 153-190, 1991
7. P.D. Seymour and R. Thomas, Call routing and the ratcatcher. Combinatorica, 14(2), 217-241, 1994
8. H. Tamaki, A linear time heuristic for the branch-decomposition of planar grpahs, Max Planck Institute Research Report, MPI-I-1-03-010, 2003.
9. H. Tamaki, Solving TSP on sparse planar graphs, in preparation.
10. TSP home page by D. Applegate, R. Bixby, W. Cook and V. Chvátal: http://www.math.princeton.edu/tsp/
11. TSPLIB by Gerd Reinelt: http://www.iwr.uni-heidelberg.de/groups/comopt/ software/TSPLIB95/
12. Planar graph test data by I.V.Hicks: http://ie.tamu.edu/People/faculty/ Hicks/data.html