Searching Trees with Sources and Targets

Authors:
Chris Worman;Boting Yang
Affiliations:
Department of Computer Science, University of Regina,;Department of Computer Science, University of Regina,
Venue:
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Year:
2008

Citing 4
Cited 1

The complexity of searching a graph

Journal of the ACM (JACM)
Recontamination does not help to search a graph

Journal of the ACM (JACM)
Edge and node searching problems on trees

Theoretical Computer Science - computing and combinatorics
Searching cycle-disjoint graphs

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

Three-fast-searchable graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a new pursuit-evasion problem on trees where a subset of vertices, called sources, are initially occupied by searchers. We also consider the scenario where some of the searchers must end their search at certain vertices called targets. We incrementally consider such problems, first considering only sources, then only targets, and finally we consider the case where there are both sources and targets. For each case we provide a polynomial-time algorithm for computing the search number, i.e. the minimum number of searchers required to clear the tree, and an optimal search strategy. We also demonstrate that each search model is monotonic, i.e. for each case their exists an optimal search strategy such that the set of cleared edges grows monotonically as the search progresses.