Searching for a Visible, Lazy Fugitive

Authors:
David Richerby;Dimitrios M. Thilikos
Affiliations:
School of Computing, University of Leeds, Leeds, UK LS2 9JT;Department of Mathematics, National and Kapodistrian University of Athens, Panepistimioupolis, Athens, Greece GR157-84
Venue:
Graph-Theoretic Concepts in Computer Science
Year:
2008

Citing 10
Cited 2

Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Monotonicity in graph searching

Journal of Algorithms
The vertex separation number of a graph equals its path-width

Information Processing Letters
Graph searching and a min-max theorem for tree-width

Journal of Combinatorial Theory Series B
Quickly excluding a planar graph

Journal of Combinatorial Theory Series B
Mixed searching and proper-path-width

Theoretical Computer Science
An annotated bibliography on guaranteed graph searching

Theoretical Computer Science
Linearity of grid minors in treewidth with applications through bidimensionality

Combinatorica
Graph searching in a crime wave

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Length-bounded cuts and flows

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Digraph Decompositions and Monotonicity in Digraph Searching

Graph-Theoretic Concepts in Computer Science
Digraph decompositions and monotonicity in digraph searching

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graph searching problems are described as games played on graphs, between a set of cops and a fugitive. Variants of the game restrict the abilities of the cops and the fugitive and the corresponding search numbers (the least number of cops that have a winning strategy) are related to several well-known parameters in graph theory. We study the case where the fugitive is visible (the cops' strategy can take into account his current position) and lazy (he moves only when the cops move to his position). Our results are stated and proven in a general setting where the fugitive's speed (i.e., the lengths of paths he can move along) can be unbounded or bounded by some constant. We give a min-max characterization of the corresponding parameters, which we show to be computable in polynomial time for fugitivess with unbounded speed and speed at most 3 and to be NP-complete for all other finite speeds. This is in contrast to the other standard versions of the game, where the parameters corresponding to fugitives with unbounded speed are NP-complete. Several consequences of our results are also discussed.