Graph searching and interval completion

SIAM Journal on Discrete Mathematics

Volumn 13, Issue 4, 2000, Pages 454-464

  Fomin, Fedor V ^a   Golovach, Petr A ^b  

^a ST PETERSBURG STATE UNIVERSITY   (Russian Federation)

^b SYKTYVKAR STATE UNIVERSITY   (Russian Federation)

Author keywords

Cograph; Graph searching; Interval graph completion; Linear layout; Profile; Search cost; Vertex separation

Indexed keywords

EID: 0042156639     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480199350477     Document Type: Article

References (38)

1. D. BIENSTOCK, Graph searching, path-width, tree-width and related problems (a survey), DIMACS Ser. Discrete Mathematics and Theoretical Computer Science 5, Amer. Math. Soc , Providence, RI, 1991, pp. 33-49.
2. D. BIENSTOCK AND P. SEYMOUR, Monotonicity in graph searching, J. Algorithms, 12 (1991), pp. 239-245.
3. A. BILLIONNET, On interval graphs and matrice profiles, RAIRO Rech. Opér., 20 (1986), pp. 245-256.
4. H. L. BODLAENDER, A partial k-arboretum of graphs with bounded treewidth, Theoret. Comput. Sci., 209 (1998), pp. 1-45.
5. H. L BODLAENDER, R. G. DOWNEY, M. R. FELLOWS, M. T. HALLETT, AND H. T. WAREHAM, Parameterized complexity analysis in computational biology, Computer Applications in the Biosciences, 11 (1995), pp. 49-57.
6. H. L. BODLAENDER AND R. H. MÖHRING, The pathwidth and treewidth of cographs, SIAM J. Discrete Math., 6 (1993), pp. 181-188.
7. J. A. BONDY, Basic graph theory: Paths and circuits, in Handbook of Combinatorics, 1, R. L. Graham, M. Grötschel, and L. Lovász, eds., Elsevier, Amsterdam, 1995, pp. 3-110.
8. A. BRANDSTÄDT, V. B. LE, and J. P. SPINRAD, Graph classes: A survey, SIAM Monogr. Discrete Math. Appl., SIAM, Philadelphia, PA, 1999.
9. L. CAI, Fixed-parameter tractability of graph modification problems for hereditary properties, Technical report, Department of Computer Science, The Chinese University of Hong Kong, Shatin New Territories, Hong Kong, 1995.
10. 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), pp. 223-254.
11. D. G. CORNEIL, Y. PERL, AND L. K. STEWART, A linear recognition algorithm for cographs, SIAM J. Comput., 14 (1985), pp. 926-934.
12. N. D. DENDRIS, L. M. KIROUSIS, AND D. M. THILIKOS, Fugitive-search games on graphs and related parameters, Theoret Comput. Sci., 172 (1997), pp. 233-254.
13. J. A. ELLIS, I. H. SUDBOROUGH, AND J. TURNER, The vertex separation and search number of a graph, Inform. and Comput., 113 (1994), pp. 50-79.
14. F. V. FOMIN AND N. N. PETROV, Pursuit-evasion and search problems on graphs, Congr. Numer., 122 (1996), pp. 47-58.
15. M. FRANKLIN, Z. GALIL, AND M. YUNG, Eavesdropping games: A graph-theoretic approach to privacy in distributed systems, in Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, 1993, pp. 670-679.
16. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability, A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York, 1979.
17. P. A. GOLOVACH, Node-search and search number of a combination of graphs, Vestnik Leningrad. Univ. Math. Mekh. Astronom., 1990, OVYR vyp. 2, 90-91, 122 (in Russian); translation in Vestnik Leningrad. Univ. Math., 23 (1990), pp. 53-55.
18. P. A. GOLOVACH, Vertex separation sum of a graph, Diskret. Mat., 9 (1997), pp. 86-91 (in Russian).
19. H. KAPLAN, R. SHAMIR, AND R. E. TARJAN, Tractability of parameterized completion problems on chordal and interval graphs: Minimum fill-in and physical mapping, in Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1994, pp. 780-791.
20. L. M. KIROUSIS AND C. H. PAPADIMITRIOU, Interval graphs and searching, Discrete Math., 55 (1985), pp. 181-184.
21. L. M. KIROUSIS AND C. H. PAPADIMITRIOU, Searching and pebbling, Theoret. Comput. Sci., 47 (1986), pp. 205-218.
22. D. KUO AND G. J. CHANG, The profile minimization problem in trees, SIAM J. Comput., 23 (1994), pp. 71-81.
23. A. S. LAPAUGH, Recontamination does not help to search a graph, J. ACM, 40 (1993), pp. 224-245.
24. T. LENGAUER, Black-white pebbles and graph separation, Acta Inform., 16 (1981), pp. 465-475.
25. F. S. MAKEDON, C. H. PAPADIMITRIOU, AND I. H. SUDBOROUGH, Topological bandwidth, SIAM J. Algebraic Discrete Methods, 6 (1985), pp. 418-444.
26. F. S. MAKEDON AND I. H. SUDBOROUGH, On minimizing width in linear layouts, Discrete Appl. Math., 23 (1989), pp. 243-265.
27. 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), pp. 18-44.
28. R. H. MÖHRING, Graph problems related to gate matrix layout and PLA folding, in Computational Graph Theory, Computing Suppl. 7, E. Mayr, H. Noltemeier, and M. Sysło, eds., Springer-Verlag, Berlin, 1990, pp. 17-51.
29. T. D. PARSONS, Pursuit-evasion in a graph, in Theory and Application of Graphs, Y. Alavi and D. R. Lick, eds., Springer Verlag, Berlin, 1976, pp. 426-441.
30. N. N. PETROV, Some extremal search problems on graphs, Differential Equations, 18 (1982), pp. 591-595. Translation from Differ. Uravn 18, (1982) pp. 821-827.
31. N. N. PETROV, Some extremal search problems on graphs, Differential Equations, 18 (1982), pp. 591-595. Translation from Differ. Uravn 18, (1982) pp. 821-827.
32. N. N. PETROV, Pursuit problems with no information concerning the evader, Differential Equations, 18 (1983), pp. 944-948. Translation from Differ. Uravn., 18 (1982), pp. 1345-1352.
33. N. N. PETROV, Pursuit problems with no information concerning the evader, Differential Equations, 18 (1983), pp. 944-948. Translation from Differ. Uravn., 18 (1982), pp. 1345-1352.
34. B. REED, Treewidth and tangles: A new connectivity measure and some applications, in Surveys in Combinatorics. R. A. Bailey, ed., Cambridge University Press, Cambridge, UK, 1997, pp. 87-162.
35. N. ROBERTSON AND P. D. SEYMOUR, Graph minors - a survey, in Surveys in Combinatorics, I. Anderson, ed., Cambridge University Press, Cambridge, UK, 1985, pp. 153-171.
36. K. SUGIHARA AND I. SUZUKI, Optimal algorithms for a pursuit-evasion problem in grids, SIAM J. Discrete Math., 2 (1989), pp. 126-143.
37. R. THOMAS, Tree decompositions of graphs, Lecture notes, Georgia Institute of Technology, Atlanta, GA, 1996.
38. Y. S. STAMATIOU AND D. M. THILIKOS, Monotonocity and Inert Fugitive Search Games, Technical Report LSI-99-35-R, Departament de Llenguatges i Sistemes Informátics, Universitat Politécnica de Catalunya, Spain, 1999.