Journal of the ACM Bibliography
N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H. Papadimitriou.
The complexity of searching a graph. Journal of the ACM,
35(1):18-44, January 1988.
[BibTeX entry]
Selected papers that cite this one
- Nick D. Dendris, Lefteris M. Kirousis, and Dimitrios M. Thilikos. Fugitive-search
games on graphs and related parameters. Theoretical Computer
Science, 172(1-2):233-254, 10 February 1997.
- J. A. Ellis, I. H. Sudborough, and J. S. Turner. The vertex separation and search
number of a graph. Information and Computation,
113(1):50-79, 15 August 1994.
- Andrea S. LaPaugh. Recontamination does not help to
search a graph. Journal of the ACM, 40(2):224-245,
April 1993.
- Ichiro Suzuki, Masafumi Yamashita, Hideki Umemoto, and Tsunehiko Kameda.
Bushiness and
a tight worst-case upper bound on the search number of a simple
polygon. Information Processing Letters, 66(1):49-52,
15 April 1998.
- Atsushi Takahashi, Shuichi Ueno, and Yoji Kajitani. Mixed searching and
proper-path-width. Theoretical Computer Science,
137(2):253-268, 23 January 1995. Mathematical Games.
Shortcuts: