On the domination search number

Discrete Applied Mathematics

Volumn 127, Issue 3, 2003, Pages 565-580

  Fomin, Fedor V ^a,b   Kratsch, Dieter ^c   Müller, Haiko ^d  

^a UNIVERSITY OF PADERBORN   (Germany)

^b ST PETERSBURG STATE UNIVERSITY   (Russian Federation)

^c UNIVERSITÉ DE LORRAINE   (France)

^d UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Asteroidal triple free graph; Dominating target; Domination; Graph searching

Indexed keywords

EID: 84867921972     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00389-X     Document Type: Article

References (38)

1. K. Ando, A. Kaneko, and S. Gervacio The bandwidth of a tree with k leaves is at most k/2 ⌉ Discrete Math. 150 1996 403 406
2. M. Bellare, S. Goldwasser, C. Lund, A. Russell, Efficient probabilistically checkable proofs and applications to approximation, in: Proceedings of the Annual ACM Symposium on Theory of Computing, Vol. 25, The Association for Computing Machinery, 1993, pp. 294-304.
3. S.L. Bezrukov, Isoperimetric problems in discrete spaces, in: Extremal Problems for Finite Sets (Visegrád, 1991), János Bolyai Math. Soc., Budapest, 1994, pp. 59-91.
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, and P. Seymour Monotonicity in graph searching J. Algorithms 12 1991 239 245
6. J.A. Bondy Basic graph theory: paths and circuits R.L. Graham, M. Grötschel, L. Lovász, Handbook of Combinatorics Vol. 1 1995 Elsevier Science Amsterdam 3 110
7. A. Brandstädt, V.B. Le, J.P. Spinrad, Graph classes: a survey, SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1999.
8. P.Z. Chinn, J. Chvátalová, A.K. Dewdney, and N.E. Gibbs The bandwidth problem for graphs and matrices - a survey J. Graph Theory 6 1982 223 254
9. D.G. Corneil, S. Olariu, and L.K. Stewart Asteroidal triple-free graphs SIAM J. Discrete Math. 10 1997 399 430
10. D.G. Corneil, S. Olariu, and L.K. Stewart Linear time algorithms for dominating pairs in asteroidal triple-free graphs SIAM J. Comput. 28 1999 1284 1297
11. D. Crass, I. Suzuki, and M. Yamashita Searching for a mobile intruder in a corridor - the open edge variant of the polygon search problem Internat. J. Comput. Geom. Appl. 5 1995 397 412
12. N.D. Dendris, L.M. Kirousis, and D.M. Thilikos Fugitive-search games on graphs and related parameters Theoret. Comput. Sci. 172 1997 233 254
13. J.A. Ellis, I.H. Sudborough, and J. Turner The vertex separation and search number of a graph Inform. Comput. 113 1994 50 79
14. F.V. Fomin Helicopter search problems, bandwidth and pathwidth Discrete Appl. Math. 85 1998 59 71
15. F.V. Fomin, and P.A. Golovach Interval completion and graph searching SIAM J. Discrete Math. 13 2000 454 464
16. F.V. Fomin, P.A. Golovach, and N.N. Petrov Search problems on 1-skeletons of regular polyhedrons Internat. J. Math. Game Theory Algebra 7 1997 101 111
17. F.V. Fomin, and N.N. Petrov Pursuit-evasion and search problems on graphs Congressus Numerantium 122 1996 47 58
18. M. Franklin, Z. Galil, and M. Yung Eavesdropping games a graph-theoretic approach to privacy in distributed systems J. ACM 47 2000 225 243
19. L.J. Guibas, J.-C. Latombe, S.M. Lavalle, D. Lin, and R. Motwani A visibility-based pursuit-evasion problem Internat. J. Comput. Geom. Appl. 9 1999 471 493
20. L.J. Harper Optimal numberings and isoperimetric problem on graphs J. Combin. Theory 8 1966 385 393
21. L.M. Kirousis, and C.H. Papadimitriou Searching and pebbling Theore. Comput. Sci. 47 1986 205 218
22. T. Kloks, D. Kratsch, H. Müller, Approximating the bandwidth of asteroidal-triple free graphs, Forschungsergebnisse Math/95/6, Friedrich Schiller Universität, Jena, Germany, 1995.
23. T. Kloks, D. Kratsch, H. Müller, On the structure of graphs with bounded asteroidal number, Technical Report Math/Inf/97/22, Friedrich-Schiller- Universität, Jena, Germany, 1997.
24. T. Kloks, D. Kratsch, and H. Müller Approximating the bandwidth of asteroidal-triple free graphs J. Algorithms 32 1999 41 57
25. A.S. LaPaugh Recontamination does not help to search a graph J. ACM 40 1993 224 245
26. S.M. LaValle, B.H. Simov, G. Slutzki, An algorithm for searching a polygonal region with a flashlight, in: Proceedings of the 16th Annual Symposium on Computational Geometry, Hong Kong, 2000, New York, 2000, ACM, pp. 260-269 (electronic).
27. J.-H. Lee, S.-M. Park, and K.-Y. Chwa Searching a polygonal room with one door by a 1-searcher Internat. J. Comput. Geom. Appl. 10 2000 201 220
28. C. Lund, and M. Yannakakis On the hardness of approximation problems J. ACM 41 1994 960 981
29. F.S. Makedon, C.H. Papadimitriou, and I.H. Sudborough Topological bandwidth SIAM J. Algebraic Discrete Methods 6 1985 418 444
30. F.S. Makedon, and I.H. Sudborough On minimizing width in linear layouts Discrete Appl. Math. 23 1989 243 265
31. B. Monien, and I.H. Sudborough Min cut is NP-complete for edge weighted trees Theoret. Comput. Sci. 58 1988 209 229
32. A. Parra, and P. Scheffler Characterizations and algorithmic applications of chordal graph embeddings Discrete Appl. Math. 79 1997 171 188
33. N.N. Petrov, and S. Starostina On some problem of guaranteed search Vestn. St.Petersb. Univ. Math 27 1994 50 51
34. N.N. Petrov, I. Ture, A pursuit problem on a graph, Vestn. Leningr. Univ., Math. (translation from Vestn. Leningr. Univ., Ser. I 4, 1990, 12-18) 23 (1990) 12-19.
35. R. Raz, S. Safra, A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP, in: Proceedings of the Annual ACM Symposium on Theory of Computing, Vol. 29, The Association for Computing Machinery, 1997, pp. 475-484.
36. N. Robertson, and P.D. Seymour Graph minors - a survey I. Anderson, Surveys in Combinatorics 1985 Cambridge University Press Cambridge 153 171
37. K. Sugihara, and I. Suzuki Optimal algorithms for a pursuit-evasion problem in grids SIAM J. Discrete Math. 2 1989 126 143
38. I. Suzuki, and M. Yamashita Searching for a mobile intruder in a polygonal region SIAM J. Comput. 21 1992 863 888