Regular Article
Fast Distributed Network Decompositions and Covers

https://doi.org/10.1006/jpdc.1996.0159Get rights and content
Under a Creative Commons license
open archive

Abstract

This paper presents deterministic sublinear-time distributed algorithms for network decomposition and for constructing a sparse neighborhood cover of a network. The latter construction leads to improved distributed preprocessing time for a number of distributed algorithms, including all-pairs shortest paths computation, load balancing, broadcast, and bandwidth management.

Cited by (0)

A preliminary version of this paper appeared in theProceedings of the Eleventh Annual ACM Symposium on the Principles of Distributed Computing.

2

Supported by NSF Contract 9114440-CCR, ARPA/Army Contract DABT63-93-C-0038, ARPA/Air Force Contract F19628-95-C-0137, and NIST/USRA Contract 5555-47.

3

Supported in part by an NSF postdoctoral research fellowship and an ONR grant provided to the Radcliffe Bunting Institute.

4

This work was done while the author was a graduate student in the Department of Mathematics at the Massachusetts Institute of Technology and supported in part by Air Force Contract OSR-89-02171, Army Contract DAAL-03-86-K-0171, and DARPA Contract N00014-91-J-1698.

5

Supported in part by an Allon Fellowship, by a Bantrell Fellowship, by a Walter and Elise Haas Career Development Award, and by the Israel Basic Research Foundation.