Graph searching with advice

Fraigniaud et al. [L. Blin, P. Fraigniaud, N. Nisse, S. Vial, Distributing chasing of network intruders, in: 13th Colloquium on Structural Information and Communication Complexity, SIROCCO, in: LNCS, vol. 4056, Springer-Verlag, 2006, pp. 70-84] introduced a new measure of difficulty for a distributed task in a network. The smallest number of bits of advice of a distributed problem is the smallest number of bits of information that has to be available to nodes in order to accomplish the task efficiently. Our paper deals with the number of bits of advice required to perform efficiently the graph searching problem in a distributed setting. In this variant of the problem, all searchers are initially placed at a particular node of the network. The aim of the team of searchers is to clear a contaminated graph in a monotone connected way, i.e., the cleared part of the graph is permanently connected, and never decreases while the search strategy is executed. Moreover, the clearing of the graph must be performed using the optimal number of searchers, i.e. the minimum number of searchers sufficient to clear the graph in a monotone connected way in a centralized setting. We show that the minimum number of bits of advice permitting the monotone connected and optimal clearing of a network in a distributed setting is @Q(nlogn), where n is the number of nodes of the network. More precisely, we first provide a labelling of the vertices of any graph G, using a total of O(nlogn) bits, and a protocol using this labelling that enables the optimal number of searchers to clear G in a monotone connected distributed way. Then, we show that this number of bits of advice is optimal: any distributed protocol requires @W(nlogn) bits of advice to clear a network in a monotone connected way, using an optimal number of searchers.

[1]  Andrea S. LaPaugh,et al.  Recontamination does not help to search a graph , 1993, JACM.

[2]  Pierre Fraigniaud,et al.  Local MST computation with short advice , 2007, SPAA.

[3]  Nicolas Nisse,et al.  Connected Treewidth and Connected Graph Searching , 2006, LATIN.

[4]  Faith Ellen,et al.  Hundreds of impossibility results for distributed computing , 2003, Distributed Computing.

[5]  Nicolas Nisse,et al.  Distributed chasing of network intruders , 2008, Theor. Comput. Sci..

[6]  Nicola Santoro,et al.  Connected and internal graph searching , 2002 .

[7]  Nicolas Nisse,et al.  Distributed Chasing of Network Intruders by Mobile Agents , 2006 .

[8]  Robin Thomas,et al.  Graph Searching and a Min-Max Theorem for Tree-Width , 1993, J. Comb. Theory, Ser. B.

[9]  Lali Barrière,et al.  Capture of an intruder by mobile agents , 2002, SPAA '02.

[10]  Boting Yang,et al.  Sweeping Graphs with Large Clique Number , 2004, ISAAC.

[11]  Daniel Bienstock,et al.  Graph Searching, Path-Width, Tree-Width and Related Problems (A Survey) , 1989, Reliability Of Computer And Communication Networks.

[12]  Christos H. Papadimitriou,et al.  The complexity of searching a graph , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[13]  David Peleg,et al.  Compact and localized distributed data structures , 2003, Distributed Computing.

[14]  Andrzej Pelc,et al.  Tree Exploration with an Oracle , 2006, MFCS.

[15]  Paola Flocchini,et al.  Contiguous search in the hypercube for capturing an intruder , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[16]  Andrzej Pelc,et al.  Oracle size: a new measure of difficulty for communication tasks , 2006, PODC '06.

[17]  Andrea E. F. Clementi,et al.  Selective families, superimposed codes, and broadcasting on unknown radio networks , 2001, SODA '01.

[18]  Paola Flocchini,et al.  Decontamination of chordal rings and tori , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[19]  Michael A. Bender,et al.  The power of a pebble: exploring and mapping directed graphs , 1998, STOC '98.

[20]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .

[21]  Paul D. Seymour,et al.  Monotonicity in Graph Searching , 1991, J. Algorithms.

[22]  Andrzej Pelc,et al.  Distributed Computing with Advice: Information Sensitivity of Graph Coloring , 2007, ICALP.