Introduction to algorithms
Introduction to distributed algorithms
Introduction to distributed algorithms
Graph relabelling systems and distributed algorithms
Handbook of graph grammars and computing by graph transformation
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Distributed Algorithms
Distributing the Execution of a Distributed Algorithm over a Network
IV '03 Proceedings of the Seventh International Conference on Information Visualization
A Programming Language for Local Computations in Graphs: Computational Completeness
ENC '04 Proceedings of the Fifth Mexican International Conference in Computer Science
Echo Algorithms: Depth Parallel Operations on General Graphs
IEEE Transactions on Software Engineering
A bridge between the asynchronous message passing model and local computations in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
IEEE Transactions on Information Theory
Workshop on Graph Computation Models
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
| Hi-index | 0.00 |
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.