Easy impossibility proofs for distributed consensus problems
Distributed Computing
Solvability of the asynchronous ranking problem
Information Processing Letters
Coverings and minors: application to local computations in graphs
European Journal of Combinatorics
On the recognition of families of graphs with local computations
Information and Computation
Graph relabelling systems and distributed algorithms
Handbook of graph grammars and computing by graph transformation
The Power of Local Computations in Graphs with Initial Knowledge
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
A Characterization of Families of Graphs in Which Election Is Possible
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible if it can be reduced to a singleton by successive removing its removable nodes; the removing procedure should be local in the sense that to decide whether a node is removable or not it is sufficient to inspect its neighborhood. The second is the notion of compositional systems, consisting of a set of objects together with a composition operation which to each pair of local objects (like local votes, partial trees, partial orderings, local consensus, local processes etc.) assigns their possible compositions; a sequence of such composition operations leads to a global object (like a global vote, a full spanning tree, a total ordering, a global consensus, a synchronized process, etc). Combining these two notions gives rise to a generic distributed algorithm for composing different local objects assigned to nodes of a reducible graph into one global object assigned to all nodes. Correctness of the composing algorithm, i.e. its proper termination and its impartiality is proved.