Exclusive Graph Searching

Lélia Blin 1, 2 Janna Burman 3 Nicolas Nisse 4
2 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
4 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : This paper tackles the well known graph searching problem, where a team of searchers aims at capturing an intruder in a network, modeled as a graph. All variants of this problem assume that any node can be simultaneously occupied by several searchers. This assumption may be unrealistic, e.g., in the case of searchers modeling physical searchers, or may require each individual node to provide additional resources, e.g., in the case of searchers modeling software agents. We thus investigate exclusive graph searching, in which no two or more searchers can occupy the same node at the same time, and, as for the classical variants of graph searching, we study the minimum number of searchers required to capture the intruder. This number is called the exclusive search number of the considered graph. Exclusive graph searching appears to be considerably more complex than classical graph searching, for at least two reasons: (1) it does not satisfy the monotonicity property, and (2) it is not closed under minor. Nevertheless, we design a polynomial-time algorithm which, given any tree T , computes the exclusive search number of T . Moreover, for any integer k, we provide a characterization of the trees T with exclusive search number at most k. This characterization allows us to describe a special type of exclusive search strategies, that can be executed in a distributed environment, i.e., in a framework in which the searchers are limited to cooperate in a distributed manner.
Liste complète des métadonnées

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00845530
Contributor : Nicolas Nisse <>
Submitted on : Wednesday, July 17, 2013 - 12:35:15 PM
Last modification on : Thursday, March 21, 2019 - 1:14:09 PM
Document(s) archivé(s) le : Wednesday, April 5, 2017 - 1:10:53 PM

File

paper_201.pdf
Files produced by the author(s)

Identifiers

Citation

Lélia Blin, Janna Burman, Nicolas Nisse. Exclusive Graph Searching. 21st European Symposium on Algorithms (ESA 2013), Sep 2013, Sophia Antipolis, France. pp.181-192, ⟨10.1007/978-3-642-40450-4_16⟩. ⟨hal-00845530⟩

Share

Metrics

Record views

912

Files downloads

296