A Distributed Algorithm for Computing the Node Search Number in Trees - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Algorithmica Année : 2012

A Distributed Algorithm for Computing the Node Search Number in Trees

Résumé

We present a distributed algorithm to compute the node search number in trees. This algorithm extends the centralized algorithm proposed by Ellis \emph{et al.}~[EST94]. It can be executed in an asynchronous environment, requires an overall computation time of $O(n\log{n})$, and $n$ messages of $\log_3{n}+4$ bits each. The main contribution of this work lies in the data structure proposed to design our algorithm, called \emph{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 $2\log_3{n}+5$ bits).
Fichier principal
Vignette du fichier
paper-noformat.pdf (452.11 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00587819 , version 1 (21-04-2011)

Identifiants

Citer

David Coudert, Florian Huc, Dorian Mazauric. A Distributed Algorithm for Computing the Node Search Number in Trees. Algorithmica, 2012, 63 (1), pp.158-190. ⟨10.1007/s00453-011-9524-3⟩. ⟨inria-00587819⟩
199 Consultations
366 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More