Nondeterministic graph searching: From pathwidth to treewidth

Lecture Notes in Computer Science

Volumn 3618, Issue , 2005, Pages 364-375

  Fomin, Fedor V ^a   Fraigniaud, Pierre ^b   Nisse, Nicolas ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b CNRS   (France)

Author keywords

Graph searching; Pathwidth; Treewidth

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; GAME THEORY; TREES (MATHEMATICS);

GRAPH SEARCHING; PATHWIDTH; TREEWIDTH;

GRAPH THEORY;

EID: 26844501762     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549345_32     Document Type: Conference Paper

References (21)

1. E. AMIR, Efficient approximation for triangulation of minimum treewidth, in Uncertainty in Artificial Intelligence: Proceedings of the Seventeenth Conference (UAI-2001), San Francisco, CA, 2001, Morgan Kaufmann Publishers, pp. 7-15.
2. S. ARNBORG, D. G. CORNEIL, AND A. PROSKUROWSKI, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods, 8 (1987), pp. 277-284.
3. D. BIENSTOCK, Graph searching, path-width, tree-width and related problems (a survey), DIMACS Ser. in Discrete Mathematics and Theoretical Computer Science, 5 (1991), pp. 33-49.
4. H. L. BODLAENDER, A partial k-arboretum of graphs with bounded treewidth, Theoret. Comput. Sci., 209 (1998), pp. 1-45.
5. V. BOUCHITTÉ, D. KRATSCH, H. MÜLLER, AND I. TODINCA. On treewidth approximations. Discrete Applied Mathematics 136(2-3), pages 183-196, 2004.
6. N. D. DENDRIS, L. M. KIROUSIS, AND D. M. THILIKOS, Fugitive-search games on graphs and related parameters, Theor. Comp. Sc., 172 (1997), pp. 233-254.
7. J. A. ELLIS, I. H. SUDBOROUGH, AND J. TURNER, The vertex separation and search number of a graph, Information and Computation, 113 (1994), pp. 50-79.
8. U. FEIGE, M. HAJIAGHAYI, J. LEE. Improved approximation algorithms for minimum-weight vertex separators. In 37th ACM Symposium on Theory of Computing (STOC 2005).
9. R. G. DOWNEY AND M. R. FELLOWS, Parameterized Complexity, Springer-Verlag, New York, 1999.
10. F. V. FOMIN, D. KRATSCH, AND I. TODINCA, Exact algorithms for treewidth and minimum fill-in, Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), LNCS vol. 3142, Springer, Berlin, 2004, pp. 568-580.
11. J. GOLDSMITH, M. LEVY, AND M. MUNHENK, Limited Nondeterminism. SIGACT News, Introduction to Complexity Theory Column 13, June 1996.
12. M. HELD AND R. KARP, A dynamic programming approach to sequencing problems, J. Soc. Indust. Appl. Math., 10 (1962), pp. 196-210.
13. L. M. KIROUSIS AND C. H. PAPADIMITRIOU, Searching and pebbling, Theor. Comp. Sc., 47 (1986), pp. 205-218.
14. F. S. MAKEDON, C. H. PAPADIMITRIOU, AND I. H. SUDBOROUGH, Topological bandwidth, SIAM J. Alg. Disc. Meth., 6 (1985), pp. 418-444.
15. F. S. MAKEDON AND I. H. SUDBOROUGH, On minimizing width in linear layouts, Disc. Appl. Math., 23 (1989), pp. 243-265.
16. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. II. Algorithmic aspects of treewidth, J. Algorithms, 7 (1986), pp. 309-322.
17. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. X. Obstructions to tree-decomposition, J. Combin. Theory Ser. B, 52 (1991), pp. 153-190.
18. P. SEYMOUR AND R. THOMAS, Graph searching and a min-max theorem for treewidth, J. Combin. Theory Ser. B, 58 (1993), pp. 22-33.
19. P. SEYMOUR AND R. THOMAS, Call routing and the ratcatcher, Combinatorica, 14 (1994), pp. 217-241.
20. R.E. TARJAN AND A.E. TROJANOWSKI, Finding a maximum independent set, SIAM J. Computing, 6 (1977), pp. 537-546.
21. G. J. WOEGINGER, Exact algorithms for NP-hard problems: a survey, in Combinatorial Optimization: "Eureka, you shrink", LNCS vol. 2570, Springer, Berlin, 2003, pp. 185-207.