Digraph searching, directed vertex separation and directed pathwidth

Discrete Applied Mathematics

Volumn 156, Issue 10, 2008, Pages 1822-1837

  Yang, Boting ^a   Cao, Yi ^a  

^a UNIVERSITY OF REGINA   (Canada)

Author keywords

Digraph searching; Directed pathwidth; Directed search; Directed vertex separation; Strong search; Undirected search; Weak search

Indexed keywords

INFORMATION RETRIEVAL SYSTEMS; SEPARATION;

(PL) PROPERTIES; EDGE DIRECTIONS; ELSEVIER (CO); PATH WIDTH; SEARCH MODELS;

ISOMERS;

EID: 45849146209     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.08.045     Document Type: Article

References (28)

1. I. Adler, Directed tree-width examples, J. Combin. Theory Ser. B 97 (5) (2007) 718-725.
2. B. Alspach, Searching and searching graphs: a brief survey, Le Matematiche, 34pp.
3. B. Alspach, D. Dyer, D. Hanson, B. Yang, Some basic results in arc searching, Technical Report CS-2006-10, Department of Computer Science, University of Regina, 2006.
4. Barat J. Directed path-width and monotonicity in digraph searching. Graphs and Combin. 22 2 (2005) 161-172
5. D. Berwanger, A. Dawar, P. Hunter, S. Kreutzer, DAG-width and parity games, in: Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science, vol. 3884, 2006, pp. 524-436.
6. Bienstock D. Graph searching, path-width, tree-width and related problems (a survey). DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 5 (1991) 33-49
7. Bienstock D., and Seymour P. Monotonicity in graph searching. J. Algorithms 12 (1991) 239-245
8. Dendris N., Kirousis L., and Thilikos D. Fugitive-search games on graphs and related parameters. Theoret. Comput. Sci. 172 (1997) 233-254
9. Ellis J., Sudborough I., and Turner J. The vertex separation and search number of a graph. Inform. and Comput. 113 (1994) 50-79
10. Evans W., and Safari M. Directed one trees. EuroComb 2005, DMTCS Proceedings AE (2005) 67-72
11. Fomin F. Helicopter search problems. bandwidth and pathwidth, Discrete Appl. Math. 85 (1998) 59-71
12. Fomin F., and Golovach P. Graph searching and interval completion. SIAM J. Discrete Math. 13 (2000) 454-464
13. Fomin F., Heggernes P., and Telle J. Graph searching, elimination trees, and a generalization of bandwidth. Algorithmica 41 (2004) 73-87
14. Fomin F., and Petrov N. Pursuit-evasion and search problems on graphs. Congr. Numer. 122 (1996) 47-58
15. Hunter P., and Kreutzer S. Digraph measures: Kelly decompositions, games, and orderings. Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA) (2007)
16. Johnson T., Robertson N., Seymour P., and Thomas R. Directed tree-width. J. Combin. Theory Ser. B 82 (2001) 138-154
17. Kinnersley N. The vertex separation number of a graph equals its path-width. Inform. Process. Lett. 42 (1992) 345-350
18. Kirousis L., and Papadimitriou C. Searching and pebbling. Theoret. Comput. Sci. 47 (1996) 205-218
19. LaPaugh A. Recontamination does not help to search a graph. J. ACM 40 (1993) 224-245
20. Megiddo N., Hakimi S., Garey M., Johnson D., and Papadimitriou C. The complexity of searching a graph. J. ACM 35 (1998) 18-44
21. Obdržálek. DAG-width: connectivity measure for directed graphs. Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA) (2006) 814-821
22. B. Reed, Introducing directed tree width, in: Sixth Twente Workshop on Graphs and Combinatorial Optimization, Enschede, 1999, 8pp (electronic), Electron. Notes Discrete Math. 3 (1999).
23. Safari M. D-width: a more natural measure for directed tree width. Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science vol. 3618 (2005) 745-756
24. Seymour P., and Thomas R. Graph searching and a min-max theorem for tree-width. J. Combin. Theory Ser. B 58 (1993) 22-33
25. Thilikos D. Algorithms and obstructions for linear-width and related search parameters. Discrete Appl. Math. 105 (2000) 239-271
26. B. Yang, Y. Cao, On the monotonicity of weak searching on digraphs, 2006, manuscript.
27. Yang B., and Cao Y. Directed searching digraphs: monotonicity and complexity. Proceedings of the Fourth Annual Conference on Theory and Applications of Models of Computation (TAMC07), Lecture Notes in Computer Science vol. 4484 (2007) 136-147
28. B. Yang, Y. Cao, Digraph strong searching: monotonicity and complexity, in: Proceedings of the Third International Conference on Algorithmic Aspects in Information and Management (AAIM07), Lecture Notes in Computer Science, vol. 4508, 2007, pp. 37-46.