Digraph Strong Searching: Monotonicity and Complexity

Authors:
Boting Yang;Yi Cao
Affiliations:
Department of Computer Science, University of Regina,;Department of Computer Science, University of Regina,
Venue:
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Year:
2007

Citing 6
Cited 4

Searching and pebbling

Theoretical Computer Science
The complexity of searching a graph

Journal of the ACM (JACM)
Monotonicity in graph searching

Journal of Algorithms
Recontamination does not help to search a graph

Journal of the ACM (JACM)
Directed tree-width

Journal of Combinatorial Theory Series B
On the monotonicity of games generated by symmetric submodular functions

Discrete Applied Mathematics - Submodularity

An annotated bibliography on guaranteed graph searching

Theoretical Computer Science
Digraph searching, directed vertex separation and directed pathwidth

Discrete Applied Mathematics
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

Given a digraph, suppose that some intruders hide on vertices or along edges of the digraph. We want to find the minimum number of searchers required to capture all the intruders hiding in the digraph. In this paper, we propose and study two digraph searching models: strong searching and mixed strong searching. In these two search models, searchers can move either from tail to head or from head to tail when they slide along edges, but intruders must follow the edge directions when they move along edges. We prove the monotonicity of each model respectively, and show that both searching problems are NP-complete.