CiteSeerX — Network Decomposition and Locality in Distributed Computation (Extended Abstract)

Network Decomposition and Locality in Distributed Computation (Extended Abstract) (1989) [60 citations — 6 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@INPROCEEDINGS{Awerbuch89networkdecomposition,
    author = {Baruch Awerbuch and Andrew V. Goldberg and Michael Luby and Serge A. Plotkin},
    title = {Network Decomposition and Locality in Distributed Computation (Extended Abstract)},
    booktitle = {},
    year = {1989},
    pages = {364--369}
}

Years of Citing Articles

Bookmarks

OpenURL

Abstract:

) Baruch Awerbuch Department of Mathematics and Laboratory for Computer Science M.I.T. Cambridge, MA 02139 Andrew V. Goldberg y Department of Computer Science Stanford University Stanford, CA 94305 Michael Luby z International Computer Science Institute Berkeley, CA 94704 Serge A. Plotkin x Department of Computer Science Stanford University Stanford, CA 94305 May 1989 Abstract We introduce a concept of network decomposition, the essence of which is to partition 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. We present an efficient distributed algorithm for constructing such a decomposition, and demonstrate its use for design of efficient distributed algorithms. Our method yields new deterministic distributed algorithms for finding a maximal independent set and for (\Delta + 1)-coloring of graphs with maximum degree \Delta. These algorithms run...

Citations

275	A Simple Parallel Algorithm for the Maximal Independent Set Problem – Luby - 1985
251	A distributed algorithm for minimum weight spanning trees – Gallager, Humblet, et al. - 1983
176	Complexity of Network Synchronization – Awerbuch - 1985
71	A Fast parallel algorithm for the maximal independent set problem – Karp, Wigderson - 1984
49	Deterministic Coin Tossing and Accelerating Cascades: Micro and Macro Techniques for Designing Parallel Algorithms – Cole, Vishkin - 1986
46	Removing Randomness in Parallel Computation Without a Processor Penalty – Luby - 1988
44	Parallel symmetry-breaking in sparse graphs – Goldberg, Plotkin, et al. - 1988
33	A New Parallel Algorithm for the Maximal Independent Set Problem – Goldberg, Spencer - 1989
23	A new distributed algorithm to find breadth first search trees – Awerbuch, Gallager - 1987
11	Distributed Shortest Paths Algorithms – Awerbuch - 1989
8	Parallel (\Delta + 1)-coloring of constant-degree graphs – Goldberg, Plotkin - 1987
4	Parallel algorithms for three graph problems – Goldberg - 1986
2	A tight lower bound on the time of distributed maximal independent set algorithms. Unpublished manuscript – Awerbuch - 1987
2	Distributive Algorithms --- Global Solutions from Local Data – Linial - 1987