Standard directed search strategies and their applications

Boting Yang () and Yi Cao
Additional contact information
Boting Yang: University of Regina
Yi Cao: University of Regina

Journal of Combinatorial Optimization, 2009, vol. 17, issue 4, No 3, 378-399

Abstract: Abstract Given a digraph that contains an intruder hiding on vertices or along edges, a directed searching problem is to find the minimum number of searchers required to capture the intruder. In this paper, we propose the standard directed search strategies, which can simplify arguments in proving search numbers, lower bounds, and relationships between search models. Using these strategies, we characterize k-directed-searchable graphs when k≤3. We also use standard directed search strategies to investigate the searching problems on oriented grids. We give tight lower and upper bounds for the directed search number of general oriented grids. Finally, we show how to compute the directed search number of a Manhattan grid.

Keywords: Digraph; Directed search; Oriented grids; Pursuit-evasion problem (search for similar items in EconPapers)
Date: 2009
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9121-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:17:y:2009:i:4:d:10.1007_s10878-007-9121-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-007-9121-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().