2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1989)
Research Triangle Park, NC, USA
Oct. 30, 1989 to Nov. 1, 1989
B. Awerbuch , MIT, Cambridge, MA, USA
The authors introduce a concept of network decomposition, a partitioning of an arbitrary graph into small-diameter connected components, such that the graph created by contracting each component into a single node has low chromatic number. They present an efficient distributed algorithm for constructing such a decomposition and demonstrate its use for design of efficient distributed algorithms. The method yields new deterministic distributed algorithms for finding a maximal independent set in an arbitrary graph and for ( Delta +1)-coloring of graphs with maximum degree Delta . These algorithms run in O(n/sup epsilon /) time for epsilon =O((log log n/log n)/sup 1/2/), whereas the best previously known deterministic algorithms required Omega (n) time. The techniques can also be used to remove randomness from the previously known most distributed breadth-first search algorithm.
deterministic algorithms, graph partitioning, distributed computation, network decomposition, arbitrary graph, distributed algorithm
M. Luby, S.A. Plotkin, A.V. Goldberg, B. Awerbuch, "Network decomposition and locality in distributed computation", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 364-369, 1989, doi:10.1109/SFCS.1989.63504