Journal of the ACM Bibliography

Selected papers that cite this one

• Hans L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209(1-2):1-45, 6 December 1998. Tutorial.

• 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.

• 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.

Selected references

• 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.

Shortcuts: