Journal article

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 (3) n+4 bits each.


Related material