Locality in Distributed Graph Algorithms
Years and Authors of Summarized Original Work
1995; Naor, Stockmeyer
2013; Fraigniaud, Korman, Peleg
In the context of distributed network computing, an important concern is the ability to design local algorithms, that is, distributed algorithms in which every node (Each node is a computing entity, which has the ability to exchange messages with its neighbors in the network along its communication links.) of the network can deliver its result after having consulted only nodes in its vicinity. The word “vicinity” has a rather vague interpretation in general. Nevertheless, the objective is commonly to design algorithms in which every node outputs after having exchanged information with nodes at constant distance from it (i.e., at distance independent of the number of nodes n in the networks) or at distance at most polylogarithmic in n, but certainly significantly smaller than n or than the diameter of the network.
The tasksto be solved by distributed...
KeywordsColoring Distributed computing Maximal independent set Network computing
- 4.Barenboim L, Elkin M, Pettie S, Schneider J (2012) The locality of distributed symmetry breaking. In: Proceedings of the 53rd IEEE symposium on foundations of computer science (FOCS), New Brunswick, pp 321–330Google Scholar
- 5.Cole R, Vishkin U (1986) Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. In: Proceedings of the 18th ACM symposium on theory of computing (STOC), Berkeley, pp 206–219Google Scholar
- 14.Schneider J, Wattenhofer R (2010) A new technique for distributed symmetry breaking. In: Proceedings of the 29th ACM symposium on principles of distributed computing (PODC), Zurich, pp 257–266Google Scholar