On the Fast Searching Problem

Authors:
Danny Dyer;Boting Yang;Öznur Yaşar
Affiliations:
Department of Mathematics and Statistics, Memorial University of Newfoundland,;Department of Computer Science, University of Regina,;Department of Mathematics and Statistics, Memorial University of Newfoundland,
Venue:
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Year:
2008

Citing 9
Cited 5

The complexity of searching a graph

Journal of the ACM (JACM)
Monotonicity in graph searching

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

Information Processing Letters
Recontamination does not help to search a graph

Journal of the ACM (JACM)
Graph Searching and Interval Completion

SIAM Journal on Discrete Mathematics
Capture of an intruder by mobile agents

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
An annotated bibliography on guaranteed graph searching

Theoretical Computer Science
Sweeping graphs with large clique number

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Lower bounds on edge searching

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Lower Bounds on Fast Searching

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Fast edge-searching and related problems

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Fast edge searching and fast searching on graphs

Theoretical Computer Science
Fast searching games on graphs

Journal of Combinatorial Optimization
Three-fast-searchable graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Edge searching is a graph problem that corresponds to cleaning a contaminated graph using the minimum number of searchers. We define fast searchingas a variant of this widely studied problem. Fast searching corresponds to an internal monotone search in which every edge is traversed exactly once and searchers are not allowed to jump. We present a linear time algorithm to compute the fast search number of trees. We investigate the fast search number of bipartite graphs. We also propose a general cost function for evaluating search strategies that utilizes both edge searching and fast searching.