Abstract
We obtain the first deterministic NC algorithm for the lowdiameter graph decomposition problem on arbitrary graphs. We achieve this through derandomizing an algorithm of Linial and Saks. Our algorithm runs in O(log5(n)) time and uses O(n2) processors.
Supported by Air Force Contract TNDGAFOSR-86-0078, ARO contract DAAL03-86-K-0171, NSF contract CCR8611442, DARPA contract N00014-89-J-1988, and a special grant from IBM.
Supported by an NSF Postdoctoral Research Fellowship.
Supported in part by DARPA contracts N00014-87-K-0825 and N00014-89-J-1988, Air Force Contract OSR-89-02171, Army Contract DAAL-03-86-K-0171 and Navy-ONR Contract N00014-19-J-1698
Supported in part by an Allon Fellowship, by a Bantrell Fellowship and by a Walter and Elise Haas Career Development Award.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Y. Afek and M. Ricklin. Sparser: A paradigm for running distributed algorithms. J. of Algorithms, 1991. Accepted for publication.
N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. of Algorithms, 7:567–583, 1986.
B. Awerbuch. Complexity of network synchronization. J. of the ACM, 32(4):804–823, Oct. 1985.
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Fast sequential constructions of sparse neighborhood covers. Unpublished manuscript, Nov. 1991.
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Fast distributed network decomposition. In Proc. 11th ACM Symp. on Principles of Distributed Computing, Aug. 1992.
B. Awerbuch, A. Goldberg, M. Luby, and S. Plotkin. Network decomposition and locality in distributed computation. In Proc. 30th IEEE Symp. on Foundations of Computer Science, May 1989.
B. Awerbuch and D. Peleg. Network synchronization with polylogarithmic overhead. In Proc. 31st IEEE Symp. on Foundations of Computer Science, pages 514–522, 1990.
B. Awerbuch and D. Peleg. Sparse partitions. In Proc. 31st IEEE Symp. on Foundations of Computer Science, pages 503–513, 1990.
Y. Bartal, A. Fiat, and Y. Rabani. Competitive algorithms for distributed data management. In Proc. 24th ACM Symp. on Theory of Computing, 1992. to appear.
R. M. Karp and A. Wigderson. A fast parallel algorithm for the maximal independent set problem. J. of the ACM, 32(4):762–773, Oct. 1985.
N. Linial and M. Saks. Decomposing graphs into regions of small diameter. In Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, pages 320–330. ACM/SIAM, 1991.
M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. on Comput., 15(4):1036–1053, Nov. 1986.
M. Luby. Removing randomness in parallel computation without a processor penalty. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 162–173. IEEE, Oct. 1988.
A. Pasconesi and A. Srinivasan. Improved algorithms for network decompositions. In Proc. 24th ACM Symp. on Theory of Computing, 1992. to appear.
S. Rao. Finding small edge cuts in planar graphs. In Proc. 24th ACM Symp. on Theory of Computing, 1992. to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Awerbuch, B., Berger, B., Cowen, L., Peleg, D. (1992). Low-diameter graph decomposition is in NC. In: Nurmi, O., Ukkonen, E. (eds) Algorithm Theory — SWAT '92. SWAT 1992. Lecture Notes in Computer Science, vol 621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55706-7_8
Download citation
DOI: https://doi.org/10.1007/3-540-55706-7_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55706-7
Online ISBN: 978-3-540-47275-9
eBook Packages: Springer Book Archive