Lower Bounds on Fast Searching

Authors:
Donald Stanley;Boting Yang
Affiliations:
Department of Mathematics and Statistics, University of Regina,;Department of Computer Science, University of Regina,
Venue:
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Year:
2009

Citing 3
Cited 2

Searching and pebbling

Theoretical Computer Science
The complexity of searching a graph

Journal of the ACM (JACM)
On the Fast Searching Problem

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a graph, suppose that intruders hide on vertices or along edges of the graph. The fast searching problem is to find the minimum number of searchers required to capture all intruders satisfying the constraint that every edge is traversed exactly once and searchers are not allowed to jump. In this paper, we prove lower bounds on the fast search number. We present a linear time algorithm to compute the fast search number of Halin graphs and their extensions. We present a quadratic time algorithm to compute the fast search number of cubic graphs.