Fugitive-search games on graphs and related parameters

Theoretical Computer Science

Volumn 172, Issue 1-2, 1997, Pages 233-254

  Dendris, Nick D ^a   Kirousis, Lefteris M ^a   Thilikos, Dimitrios M ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATION THEORY; GRAPH THEORY; OPTIMIZATION; TREES (MATHEMATICS);

BOOLEAN SATISFIABILITY PROBLEMS; CONSTRAINT SATISFACTION; FUGITIVE SEARCH GAMES; TREEWIDTH;

GAME THEORY;

EID: 0031072183     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00177-6     Document Type: Article

References (35)

1. R. Anderson and E. Mayr, Parallelism and greedy algorithms, Adv. Comput. Res. 4 (1987) 17-38; see also: A P-complete problem and approximations to it, Tech. Report, Dept. Computer Science, Stanford University, California, 1984.
2. R. Anderson and E. Mayr, Parallelism and greedy algorithms, Adv. Comput. Res. 4 (1987) 17-38; see also: A P-complete problem and approximations to it, Tech. Report, Dept. Computer Science, Stanford University, California, 1984.
3. S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability (a survey), BIT 25 (1985) 2-33.
4. D. Bienstock, Graph searching, path-width, tree-width and related problems (a survey), DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 5 (1991) 33-49.
5. D. Bienstock, N. Robertson, P.D. Seymour and R. Thomas, Quickly excluding a forest, J. Combin. Theory Ser. B 52 (1991) 274-283.
6. D. Bienstock and P.D. Seymour, Monotonicity in graph searching, J. Algorithms 12 (1991) 239-245.
7. H.L. Bodlaender, Classes of graphs with bounded treewidth, Tech. Report RUU-CS-86-22, Dept. of Computer Science, Utrect University, The Netherlands, 1986.
8. H.L. Bodlaender, A tourist guide through treewidth, Acta Cybernet. 11 (1993) 1-21.
9. H.L. Bodlaender and R.H. Möhring, The pathwidth and treewidth of cographs, in: Proc. 2nd Scandinavian Workshop on Algorithm Theory (SWAT) 1990, Lecture Notes in Computer Science 447 (Springer, Berlin, 1990) 301-309.
10. H.L. Bodlaender and D.M. Thilikos, Treewidth and small separators for graphs with small chordality, Tech. Report UU-CS-1995-02, Dept. of Computer Science, Utrecht University, Utrecht, The Netherlands, 1995.
11. R. Breisch, An intuitive approach to speleotopology, in: Southwestern Cavers, Vol. VI (Southwestern Region of the National Speleological Society, 1967) 72-78.
12. R. Dechter, Constraint networks, in: S.C. Shapiro, ed., Encyclopedia of Artificial Intelligence (Wiley, New York, 1992) 285-293.
13. R. Dechter, Directional resolution: the Davis-Putnam procedure, revised, in: Working Notes AAAI Spring Symp. on AI and NP-Hard Problems (1993) 29-35.
14. R. Dechter and J. Pearl, Tree clustering for constraint networks, Artificial Intelligence 38 (1989) 353-366.
15. J.A. Ellis, I.H. Sudborough and J.S. Turner, The vertex separation number of a graph, in: Proc. 1983 Allerton Conf. on Comunication and Computing (1983) 224-233.
16. M. Franklin, Z. Galil and M. Yung, Eavesdropping games: a graph-theoretic approach to privacy in distributed systems, in: Proc. 34th Annual Symp. on Foundations of Computer Science (FOCS) 1993 (IEEE Computer Soc. Press, Silver Spring, MD, 1993) 670-679.
17. E.C. Freuder, A sufficient condition for backtrack-free search, J ACM 29 (1982) 24-32.
18. E.C. Freuder, A sufficient condition for backtrack-bounded search, J. ACM 32 (1985) 755-761.
19. F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, J. Combin. Theory Ser. B 16 (1974) 47-56.
20. N.G. Kinnersley, The vertex separation number of a graph equals its path-width, Inform. Process. Lett. 42 (1992) 345-350.
21. L.M. Kirousis and C.H. Papadimitriou, Interval graphs and searching, Discrete Math. 55 (1985) 181-184.
22. L.M. Kirousis and C.H. Papadimitriou, Searching and pebbling, J. Theoret. Comput. Sci. 47 (1986) 205-218.
23. L.M. Kirousis and D.M. Thilikos, The linkage of a graph, SIAM J. Comput., to appear.
24. T. Kloks, Treewidth, Ph.D. Thesis, Utrecht University, The Netherlands, 1993.
25. A.S. LaPaugh, Recontamination does not help to search a graph, J. ACM 40 (1993) 224-245.
26. A. Mackworth, Constraint satisfaction, in: S.C. Shapiro, ed., Encyclopedia of Artificial Intelligence (Wiley, New York, 1992) 276-285.
27. A. Mackworth and E. Freuder, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artificial Intelligence 25 (1985) 65-74.
28. D.W. Matula, A min-max theorem for graphs with application to graph coloring, SIAM Rev. 10 (1968) 481-482.
29. N. Megiddo, S.L. Hakimi, M.R. Garey, D.S. Johnson and C.H. Papadimitriou, The complexity of searching a graph, J. ACM 35 (1988) 18-44
30. R.H. Möhring, Graph problems related to gate matrix layout and PLA folding, in: E. Mayr, H. Noltemeier and M. Syslo, eds., Computational Graph Theory, Computing Supplementum, Vol. 7 (1990) 17-51.
31. T.D. Parsons, Pursuit-evasion in a graph, in: Y. Alavi and D.R. Lick, eds., Theory and Applications of Graphs (Springer, Berlin, 1976) 426-441.
32. T.D. Parsons, The search number of a connected graph, in: Proc, 9th Southeastern Conf. on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica, Winnipeg, Canada (1978) 549-554.
33. N. Robertson and P.D. Seymour, Graph minors III. Planar tree-width, J. Combin. Theory Ser. B 36 (1984) 49-64.
34. P.D. Seymour and R. Thomas, Graph searching and a minimax theorem for tree-width, J. Combin. Theory Ser. B 58 (1993) 22-33.
35. J. van Leeuwen, Graph algorithms, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. A (Elsevier, Amsterdam, 1990) 527-631.