Helicopter search problems, bandwidth and pathwidth

Discrete Applied Mathematics

Volumn 85, Issue 1, 1998, Pages 59-70

  Fomin, F V ^a  

^a ST PETERSBURG STATE UNIVERSITY   (Russian Federation)

Author keywords

Bandwidth; Computational complexity; Pathwidth; Searching a graph

Indexed keywords

EID: 0009377797     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00131-5     Document Type: Article

References (28)

1. M. Aigner, M. Fromm, A game of cops and robbers, Discrete Appl. Math. 8 (1984) 1-12.
2. T. Andreae, On a pursuit game played on graphs for which a minor is excluded, J. Combin. Theory. Ser. B 41 (1986) 37-47.
3. A. Beraducci, B. Intrigila, On the cops number of a graph, Adv. Appl. Math. 14 (1993) 389-403.
4. D. Bienstock, Graph searching, path-width, tree-width and relative problems (a survey), Reliability of computer and communication networks. Proc. workshop, New Brunswick, NJ/USA 1989, DIMACS Ser. Discrete Math. Theor. Comput. Sci. 5 (1991) 33-49.
5. H.L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Technical Report UlJ-CS-1996-02, Department of Computer Science, Utrecht University, the Netherlands, 1996.
6. R.S. Chang, Single step graph search problem, Inform. Process. Lett. 40 (1991) 107-111.
7. P.Z. Chinn, J. Chvatalova, A.K. Dewdney, N.E. Gibbs, The bandwidth problem for graphs and matrices - a survey, J. Graph Theory 6 (1982) 223-254.
8. R.D. Dawes, Some pursuit-evasion problems on grids, Inform. Process. Lett. 43 (1992) 241-247.
9. N.D., Dendris, L.M., Kirousis, D.M. Thilikos, Fugitive-search games on graphs and related parameters, Theor. Comp. Sc. 172 (1997) 233-254.
10. F.V. Fomin, N.N. Petrov, Pursuit-evasion and search problems on graphs, Congr. Numer. 122 (1996) 47-58.
11. M. Franklin, Z. Galil, M. Yung, Eavesdropping games: a graph-theoretic approach to privacy in distributed systems, Proc. 34th Annual Symp. on Foundations of Computer Science, 1993, IEEE Computer Society Press, Silver Spring, MD, pp. 670-679.
12. M.R. Garey, R.L. Graham, D.S. Johnson, D.E. Knuth, Complexity results for bandwidth minimization, SIAM J. Appl. Math. 34 (1978) 477-495.
13. P.A. Golovach, On one extremal search problem on graphs, Vestnik Leningrad Univ. Ser. 13 (1990) no. 15, 16-21 (in Russian).
14. T. Kashiwabara, T. Fujisawa, NP-completness of the problem of finding a minimum clique number interval graph containing a given graph as a subgraph, in: Proc. ISCAS, 1979, pp. 657-660.
15. L.M. Kirousis, C.H. Papadimitriou, Interval graphs and searching, Discrete Math. 55 (1985) 181-184.
16. L.M. Kirousis, C.H. Papadimitriou, Searching and pebbling, Theoret. Comput. Sci. 47 (1986) 205-218.
17. A. Kornai, Z. Tuza, Narrowness, pathwidth, and their application in natural language processing, Discrete Appl. Math. 36 (1992) 87-92.
18. A. LaPaugh, Recontamination does not help to search a graph, J. ACM. 40 (1993) 224-245.
19. T. Lengauer, Black-white pebbles and graph separation, Acta Inform. 16 (1981) 465-475.
20. F.S. Makedon, C.H. Papadimitriou, I.H. Sudborough, Topological bandwidth, SIAM J. Algebra Discrete Meth. 6 (1985) 418-443.
21. Z. Miller, A linear algorithm for topological bandwidth in degree-three trees, SIAM J. Comput. 17 (1988) 1018-1035.
22. R.H. Möhring, Graph problems related to gate matrix layout and PLA folding, in: G. Tinhofer et al. (Eds.), Computional Graph Theory, (Comput. Suppl) vol. 7, Springer, Wien, 1990, pp. 17-51.
23. T. Ohtsuki, H. Mori, E.S. Kuh, T. Kashiwabara, T. Fujisawa, One-dimensional logic gate assignment and interval graphs, IEEE Trans. Curcuits Systems 26 (1979) 675-684.
24. T.D. Parsons, Pursuit-evasion in a graph, in: Y. Alavi, D.R. Lick (Eds.), Theory and Application of Graphs, Springer, Berlin, 1976, pp. 426-441.
25. N.N. Petrov, On some extremal search problems on graphs, Diff. Uravnenia 18 (5) (1982) 821-827 (in Russian).
26. N.N. Petrov, I. Ture, A pursuit problem on a graph, Vestnik Leningrad Univ. Math 23 (4) (1990) 12-19.
27. N. Robertson, P.D. Seymour, Graph minors I, excluding a forest, J. Combin. Theory, Ser. B 35 (1983) 39-61.
28. H. Sugihara, I. Suzuki, Optimal algorithms for a pursuit-evasion problem in grids, SIAM J. Discrete Math. 2 (1989) 126-143.