Arc searching digraphs without jumping

Authors:
Brian Alspach;Danny Dyer;Denis Hanson;Boting Yang
Affiliations:
Department of Mathematics and Statistics, University of Regina;Department of Mathematics and Statistics, Memorial University of Newfoundland;Department of Mathematics and Statistics, University of Regina;Department of Computer Science, University of Regina
Venue:
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Year:
2007

Citing 11
Cited 3

Searching and pebbling

Theoretical Computer Science
The complexity of searching a graph

Journal of the ACM (JACM)
On search decision and the efficiency of polynomial-time algorithms

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Search and sweep numbers of finite directed acyclic graphs

Discrete Applied Mathematics
Graph theory and its applications

Graph theory and its applications
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems

Journal of the ACM (JACM)
Directed tree-width

Journal of Combinatorial Theory Series B
DAG-width: connectivity measure for directed graphs

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Digraph measures: Kelly decompositions, games, and orderings

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Directed searching digraphs: monotonicity and complexity

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Sweeping graphs with large clique number

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

An annotated bibliography on guaranteed graph searching

Theoretical Computer Science
On the Monotonicity of Weak Searching

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Monotonicity in digraph search problems

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The arc-searching problem is a natural extension of the edge searching problem, which is to determine the minimum number of searchers (search number) needed to capture an invisible fast intruder in a graph. We examine several models for the internal arc-searching problem, in which the searchers may not "jump" from a vertex to a nonadjacent vertex. We will explore some elementary results and characterize directed graphs with small search number for the various models.