Distributed Graph Traversals by Relabeling Systems with Applications - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Distributed Graph Traversals by Relabeling Systems with Applications

B. Derbel
  • Fonction : Auteur

Résumé

Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and the convergecast. This encoding allows us to derive formal, modular and simple encoding for many distributed graph algorithms. We illustrate this method by investigating the distributed computation of a breadth-first spanning tree and the distributed computation of a minimum spanning tree. Our formalism allows to focus on the correctness of a distributed algorithm rather than on the implementation and the communication details.

Domaines

Autre [cs.OH]

Dates et versions

hal-00307548 , version 1 (29-07-2008)

Identifiants

Citer

B. Derbel, Mohamed Mosbah. Distributed Graph Traversals by Relabeling Systems with Applications. Workshop on Graph Transformation for Verification and Concurrency, Aug 2005, United States. pp.79-94, ⟨10.1016/j.entcs.2005.03.034⟩. ⟨hal-00307548⟩

Collections

CNRS
40 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More