Time constrained graph searching

  • Authors:

  • Brian Alspach;Danny Dyer;Denis Hanson;Boting Yang

  • Affiliations:

  • Department of Mathematics and Statistics, University of Regina, Regina, Saskatchewan, Canada S42 0A2;Department of Mathematics and Statistics, University of Regina, Regina, Saskatchewan, Canada S42 0A2;Department of Mathematics and Statistics, University of Regina, Regina, Saskatchewan, Canada S42 0A2;Department of Computer Science, University of Regina, Regina, Saskatchewan, Canada S4S 0A2

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2008

Quantified Score

Hi-index 5.23

Visualization

Abstract

We consider time constraints for four models of searching graphs for intruders. One model is the standard cops and robber vertex-searching model with complete visibility. The second model differs from the preceding one only in that none of the searchers can see the intruder. The third model is a vertex-searching model in which searchers and an intruder move simultaneously and none of the searchers can see the intruder. The fourth model is simultaneous edge searching with an arbitrarily fast intruder.