Computing optimal linear layouts of trees in linear time

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

Volumn 1879, Issue , 2000, Pages 403-414

  Skodinis, Konstantin ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; FORESTRY; TREES (MATHEMATICS);

EDGE SEARCHES; LINEAR TIME; LINEAR-TIME ALGORITHMS; RUNNING TIME; SEARCH STRATEGIES;

TREES (MATHEMATICS); ALGORITHMS;

ALGORITHMS; COMPUTATION; TREES;

EID: 35649022756     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45253-2_37     Document Type: Article

References (21)

1. H. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAMJ. Comput., 25(6):1305-1317, 1996.
2. H. Bodlaender and T. Kloks. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms, 21:358—402, 1996.
3. H. Bodlaender, T. Kloks, and D. Kratsch. Treewidth and pathwidth of permutation graphs. SIAMJ. Disc. Math., 8:606-616, 1995.
4. H. Bodlaender and R. Morning. The pathwidth and treewidth of cographs. SIAM J. Disc. Math., 6:181-188, 1993.
5. M. Chung, F. Makedon, I. Sudborough, and J. Turner. Polynomial algorithms for the mincut linear arrangement problem on degree restricted trees. SIAMJ. Comput., 14(1):158-177,1985.
6. S. Cook and R. Sethi. Storage requirements for deterministic polynomial finite recognizable languages. J. Comput. System Sci., 13:25-37, 1976.
7. J. Ellis, I. Sudborough, and J. Turner. The vertex separation and search number of a graph. Inform. Comput., 113:50-79, 1994.
8. J. Gustedt. On the pathwidth of chordal graphs. Disc. Appl. Math., 45:233-248, 1993.
9. N. Kinnersley. The vertex separation number of a graph equals its path-width. Inform. Process. Lett., 142:345-350, 1992.
10. L. Kirousis and C. Papadimitriou. Interval graphs and searching. Disc. Math., 55:181-184, 1985.
11. L. Kirousis and C. Papadimitriou. Searching and pebbling. Theor. Comp. Science, 47:205218, 1986.
12. A. LaPaugh. Recontamination does not help to search a graph. J. Assoc. Comput. Mach.,40(2):243-245, 1993
13. T. Lengauer. Black-white pebbles and graph separation. Acta Informat., 16:465-475, 1981.
14. F. Makedon and I. Sudborough. On minimizing width in linear layouts. Disc. Appl. Math., 23:243-265, 1989.
15. N. Megiddo, S. Hakimi, M. Garey, D. Johnson, and C. Papadimitriou. The complexity of searching a graph. J. Assoc. Comput. Mach., 35(1):18-44, 1988.
16. R. H. Morning. Graph problems related to gate matrix layout and PLA folding. In E. Mayr, H. Noltmeier, and M. Syslo, editors, Computational Graph Theory, pages 17-51. Springer Verlag, 1990.
17. F. Monien and I. Sudborough. Min cut is NP-complete for edge weighted trees. Theor. Comp. Science, 58:209-229, 1988.
18. T. Parsons. Pursuit-evasion in a graph. In Y. Alavi and D. Lick, editors, Theory and Applications of Graphs, pages 426-441. Springer-Verlag, New York/Berlin, 1976.
19. N. Robertson and P. Seymour. Graph minors. I. Excluding a forest. J. Comb. Theory Series B, 35:39-61, 1983.
20. N. Robertson and P. Seymour. Disjoint paths-A servey. SIAM J. Alg. Disc. Meth., 6:300-305,1985.
21. M. Yannakakis. A polynomial algorithm for the min-cut linear arrangement of trees. J.Assoc. Comput. Mach., 32(4):950-988, 1985.