On the Complexity of Distributed Network Decomposition

Journal of Algorithms

Volumn 20, Issue 2, 1996, Pages 356-374

  Panconesi, Alessandro ^a   Srinivasan, Aravind ^b  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

GRAPH DEGREE; MAXIMAL GRAPH; MAXIMAL INDEPENDENT SET;

ALGORITHMS;

EID: 0030376775     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0017     Document Type: Article

References (23)

1. N. Alon, L. Babai, and A. Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms 7 (1986), 567-583.
2. B. Awerbuch, Complexity of network synchronization, J. Assoc. Comput. Mach. 32 (1985), 804-823.
3. B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin, Network decomposition and locality in distributed computation, in "Proceedings IEEE Symposium on Foundations of Computer Science, 1989," pp. 364-369.
4. B. Awerbuch and D. Peleg, Routing with polynomial communication-space trade-off, SIAM J. Discrete Math. 5 (1992), 151-162.
5. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg, Fast network decomposition, in "Proceedings ACM Symposium on Principles of Distributed Computing, 1992," pp. 169-177.
6. B. Berger and L. Cowen, Fast deterministic constructions of low-diameter network decompositions, MIT-LCS Technical Memo 460, Apr. 1991.
7. M. Choy and A. K. Singh, Efficient fault tolerant algorithms for resource allocation in distributed systems, in "Proceedings ACM Symposium on Theory of Computing, 1992," pp. 593-602.
8. R. Cole and U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking, Inform. Control 70 (1986), 32-53.
9. A. V. Goldberg, S. A. Plotkin, and G. E. Shannon, Parallel symmetry-breaking in sparse graphs, SIAM J. Discrete Math. 1 (1989), 434-446.
10. M. Karchmer and J. Naor, A fast parallel algorithm to color a graph with Δ colors, J. Algorithms 9 (1988), 83-91.
11. H. J. Karloff, A Las Vegas RNC algorithm for maximum matching, Combinatorica 6(4) (1986), 387-391.
12. H. J. Karloff, An NC algorithm for Brooks' theorem, Theoret. Comput. Sci. 68(1) (1989), 89-103.
13. H. J. Karloff and J. Boyar, Coloring planar graphs in parallel, J. Algorithms 8 (1987), 470-479.
14. H. J. Karloff and D. B. Shmoys, Efficient parallel algorithms for edge coloring problems, J. Algorithms 8 (1987), 39-52.
15. R. M. Karp and A. Wigderson, A fast parallel algorithm for the maximal independent set problem, J. Assoc. Comput. Mach. 32 (1985), 762-773.
16. N. Linial, Locality in Distributed Graph Algorithms, SIAM J. Comput. 21 (1993), 193-201.
17. N. Linial and M. Saks, Decomposing graphs into regions of small diameter, in "Proceedings ACM/SIAM Symposium on Discrete Algorithms, 1991," pp. 320-330.
18. M. Luby, A simple parallel algorithm or the maximal independent set problem, SIAM J. Comput. 15(4) (1986), 1036-1053.
19. M. Luby, Removing randomness in parallel computation without a processor penalty, J. Comput. System Sci. 47(2) (1993), 250-286.
20. N. A. Lynch, Upper bounds for static resource allocation in a distributed system, J. Comput. System Sci. 23 (1981), 254-278.
21. A. Panconesi, Locality in distributed computation, Ph.D. thesis, Cornell University, Aug. 1993.
22. A. Panconesi and A. Srinivasan, The local nature of Δ-coloring and its algorithmic applications, Combinatorica 15(2) (1995), 255-280.
23. E. Styer and G. L. Peterson, Improved algorithms for distributed resource allocation, in "Proceedings ACM Symposium on Principles of Distributed Computing, 1988," pp. 105-116.