Computing small search numbers in linear time*

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

Volumn 3162, Issue , 2004, Pages 37-48

  Bodlaender, Hans L ^a   Thilikos, Dimitrios M ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Characteristics; Graph searching; Linear Width; Pathwidth; Treewidth

Indexed keywords

CLUSTERING ALGORITHMS; PARAMETER ESTIMATION;

CHARACTERISTICS; GRAPH SEARCHING; LINEAR-WIDTH; PATHWIDTH; TREE-WIDTH;

GRAPH THEORY;

EID: 35048890552     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28639-4_4     Document Type: Article

References (28)

1. D. Bienstock. Graph searching, path - width, tree - width and related problems (a survey). In Reliability of computer and communication networks (New Brunswick, NJ, 1989), volume 5 of DIMACS Ser. Discrete Math. Theoret. Comput. Sei., pages 33-49. Amer. Math. Soc., Providence, RI, 1991.
2. D. Bienstock and P. Seymour. Monotonicity in graph searching. Journal of Algorithms, 12(2):239-245, 1991.
3. H. L. Bodlaender. A linear - time algorithm for finding tree - decompositions of small treewidth. SIAM J. Comput., 25(6):1305-1317, 1996.
4. H. L. Bodlaender and T. Kloks. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Journal of Algorithms, 21:358-402, 1996.
5. H. L. Bodlaender and D. M.- Thilikos. Constructive linear time algorithms for branchwidth. In Automata, languages and programming (Bologna, 1997), volume 1256 of Lecture Notes in Computer Science, pages 627-637. Springer, Berlin, 1997.
6. H. L. Bodlaender and D. M. Thilikos. Computing small search numbers in linear time. Technical Report UU-CS-1998-05, Dept. of Computer Science, Utrecht University, 1998.
7. R. Breisch. An intuitive approach to speleotopology. A publication of the Southwestern Region of the National Speleological Society, VI:72-78, 1967.
8. N. Dendris, L. Kirousis, and D. Thilikos. Fugitive - search games on graphs and related parameters. Theoretical Computer Science, 172:233-254, 1997.
9. . J. A. Ellis, I. H. Sudborough, and J. S. Turner. The vertex separation and search number of a graph. Inform, and Comput., 113(l):50-79, 1994.
10. M. R. Fellows and M. A. Langsten. On search, decision, and the efficiency of polynomial - time algorithms. J. Comput. System Sci., 49(3):769-779, 1994.
11. H. Friedman, N. Robertson, and P. Seymour. The metamathematics of the graph minor theorem. In Logic and combinatorics (Arcata, Calif., 1985), volume 65 of Contemp. Math., pages 229-261. Amer. Math. Soc., Providence, RI, 1987.
12. N. G. Kinnersley. The vertex separation number of a graph equals its path - width. Inform. Process. Lett, 42(6):345-350, 1992.
13. L. M. Kirousis and C. H. Papadimitriou. Interval graphs and searching. Discrete Math., 55(2):181-184, 1985.
14. L. M. Kirousis and C. H. Papadimitriou. Searching and pebbling. Theoret. Comput. Sei., 47(2):205-218, 1986.
15. A. S. LaPaugh. Recontamination does not help to search a graph. J. Assoc. Comput. Mach., 40(2):224-245, 1993.
16. N. Megiddo, S. L. Hakirni, M. R. Garey, D. S. Johnson, and C. H. Papadimitriou. The complexity of searching a graph. J. Assoc. Comput. Mach., 35(l):18-44, 1988.
17. R. H. Möhring. Graph problems related to gate matrix layout and PLA folding. In Computational graph theory, volume 7 of Comput. Suppl, pages 17-51. Springer, Vienna, 1990.
18. T. D. Parsons. Pursuit - evasion in a graph. In Theory and applications of graphs (Proc. Internat. Conf., Western Mich. Univ., Kalamazoo, Mich., 1976), pages 426441. Lecture Notes in Math., Vol. 642. Springer, Berlin, 1978.
19. N. Robertson and P. D. Seymour. Disjoint paths - a survey. SIAM J. Algebraic Discrete Methods, 6(2):300-305, 1985.
20. N. Robertson and P. D. Seymour. Graph minors - a survey. In Surveys in combinatorics 1985 (Glasgow, 1985), volume 103 of London Math. Soc. Lecture Note Ser., pages 153-171. Cambridge Univ. Press, Cambridge, 1985.
21. N. Robertson and P. D. Seymour. An outline of a disjoint paths algorithm. Paths, Flows and VLSI Design, Algorithms and Combinatorics, 9:267-292, 1990.
22. N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory. Series B, 63(1):65-110, 1995.
23. P. D. Seymour and R. Thomas. Graph searching and a min - max theorem for tree - width. J. Combin. Theory Ser. B, 58(1):22-33, 1993.
24. A. Takahashi, S. Ueno, and Y. Kajitani. Minimal forbidden minors for the family of graphs with proper - path - width at most two. IEICE Trans. Fundamentals, E78A:1828-1839, 1995.
25. D. M. Thilikos. Algorithms and obstructions for linear - width and related search parameters. Discrete Applied Mathematics, 105:239-271, 2000.
26. D. M. Thilikos, M. J. Serna, and H. L. Bodlaender. Constructinve linear time algorithms for small cutwidth and carving-width. In D. Lee and S.-H. Teng, editors, Proc. llth Internatinal Conference ISAAC 2000, volume 1969 of Lectures Notes in Computer Science, pages 192-203. Springer - Verlag, 2000.
27. D. M. Thilikos, M. J. Serna, and H. L. Bodlaender. A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth. In AlgorithmsESA 2001 (Århus), volume 2161 of Lecture Notes in Comput. Sei., pages 380-390. Springer, Berlin, 2001.
28. R. Thomas. Tree - decompositions of graphs. Lecture notes, School of Mathematics. Georgia Institute of Technology, Atlanta, Georgia 30332, USA, 1996.