A Distributed Algorithm for Computing the Node Search Number in Trees

We present a distributed algorithm to compute the node search number in trees. This algorithm extends the centralized algorithm proposed by Ellis et al. (Inf. Comput. 113(1):50–79, 1994). It can be executed in an asynchronous environment, requires an overall computation time of O(nlog n), and n messages of log 3n+4 bits each.The main contribution of this work lies in the data structure proposed to design our algorithm, called hierarchical decomposition. This simple and flexible data structure is used for four operations: updating the node search number after addition or deletion of any tree-edges in a distributed fashion; computing it in a tree whose edges are added sequentially and in any order; computing other graph invariants such as the process number and the edge search number, by changing only initialization rules; extending our algorithms for trees and forests of unknown size (using messages of up to 2log 3n+5 bits).

[1]  Nancy G. Kinnersley,et al.  The Vertex Separation Number of a Graph equals its Path-Width , 1992, Inf. Process. Lett..

[2]  Bo Zhou,et al.  Minimal energy of unicyclic graphs of a given diameter , 2008 .

[3]  Dorian Mazauric,et al.  Reconfiguration of the routing in WDM networks with two classes of services , 2009, 2009 International Conference on Optical Network Design and Modeling.

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

[5]  Dimitrios M. Thilikos,et al.  An annotated bibliography on guaranteed graph searching , 2008, Theor. Comput. Sci..

[6]  John A. Ellis,et al.  Computing the vertex separation of unicyclic graphs , 2004, Inf. Comput..

[7]  Rainer Bodendiek,et al.  Topics In Combinatorics and Graph Theory , 1992 .

[8]  Jean-Sébastien Sereni,et al.  Rerouting requests in WDM networks , 2005 .

[9]  Hsin-Hung Chou.  On the vertex separation of unicyclic graphs , 2006 .

[10]  Lali Barrière,et al.  Searching Is Not Jumping , 2003, WG.

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

[12]  Konstantin Skodinis.  Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time , 2003, J. Algorithms.

[13]  Paul D. Seymour,et al.  Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[14]  Rodica Mihai,et al.  Pathwidth is NP-Hard for Weighted Trees , 2009, FAW.

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

[16]  Jean-Sébastien Sereni,et al.  Characterization of graphs and digraphs with small process numbers , 2011, Discret. Appl. Math..

[17]  P. Scheffler,et al.  A Linear Algorithm for the Pathwidth of Trees , 1990 .

[18]  Nicolas Nisse,et al.  Nondeterministic Graph Searching: From Pathwidth to Treewidth , 2005, Algorithmica.

[19]  B. Mohar,et al.  Graph Minors , 2009 .

[20]  Ivan Hal Sudborough,et al.  The Vertex Separation and Search Number of a Graph , 1994, Inf. Comput..

[21]  Christos H. Papadimitriou,et al.  Searching and Pebbling , 1986, Theor. Comput. Sci..

[22]  JOSEP DÍAZ,et al.  A survey of graph layout problems , 2002, CSUR.

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

[24]  D. R. Lick,et al.  Theory and Applications of Graphs , 1978 .

[25]  Chuan Yi Tang,et al.  Edge and Node Searching Problems on Trees , 1997, COCOON.