Directed searching digraphs: monotonicity and complexity

Authors:
Boting Yang;Yi Cao
Affiliations:
Department of Computer Science, University of Regina;Department of Computing Science, University of Alberta
Venue:
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Year:
2007

Citing 9
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)
Graph searching and a min-max theorem for tree-width

Journal of Combinatorial Theory Series B
Directed tree-width

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

Discrete Applied Mathematics - Submodularity
DAG-Width and parity games

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
D-Width: a more natural measure for directed tree width

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

An annotated bibliography on guaranteed graph searching

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

Discrete Applied Mathematics
On the Monotonicity of Weak Searching

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Arc searching digraphs without jumping

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce and study two new search models on digraphs: the directed searching and mixed directed searching. In these two search models, both searchers and intruders must follow the edge directions when they move along edges. We prove the monotonicity of both search models, and we show that both directed and mixed directed search problems are NP-complete.