Skip to Main content Skip to Navigation
Journal articles

The Cost of Monotonicity in Distributed Graph Searching

David Ilcinkas 1, 2 Nicolas Nisse 3 David Soguet 4
2 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
CNRS - Centre National de la Recherche Scientifique : UMR5800, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Inria Bordeaux - Sud-Ouest, Université Sciences et Technologies - Bordeaux 1
3 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : Blin et al. (TCS 2008) proposed a distributed protocol enabling the smallest possible number of searchers to clear any unknown graph in a decentralized manner. However, the strategy that is actually performed lacks of an important property, namely the monotonicity. This paper deals with the smallest number of searchers that are necessary and sufficient to monotonously clear any unknown graph in a decentralized manner. The clearing of the graph is required to be connected, i.e., the clear part of the graph must remain permanently connected, and monotone, i.e., the clear part of the graph only grows. We prove that a distributed protocol clearing any unknown $n$-node graph in a monotone connected way, in a decentralized setting, can achieve but cannot beat competitive ratio of $\Theta(\frac{n}{\log n})$, compared with the centralized minimum number of searchers. Moreover, our lower bound holds even in a synchronous setting, while our constructive upper bound holds even in an asynchronous setting.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : David Ilcinkas <>
Submitted on : Monday, August 31, 2009 - 4:08:06 PM
Last modification on : Tuesday, February 9, 2021 - 3:00:04 PM
Long-term archiving on: : Tuesday, June 15, 2010 - 10:59:03 PM


Files produced by the author(s)



David Ilcinkas, Nicolas Nisse, David Soguet. The Cost of Monotonicity in Distributed Graph Searching. Distributed Computing, Springer Verlag, 2009, 22 (2), pp.117-127. ⟨10.1007/s00446-009-0089-1⟩. ⟨hal-00412063⟩



Record views


Files downloads