Improved distributed algorithms for coloring and network decomposition problems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 581-592

  Panconesi, Alessandro ^a   Srinivasan, Aravind ^a  

^a Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COLORING; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; SET THEORY; TOPOLOGY;

BIPARTITE GRAPHS; BROOKS' THEOREM; CLUSTER DECOMPOSITION; DISTRIBUTED GRAPH ALGORITHMS; DISTRIBUTED MODELING; MAXIMAL INDEPENDENT SET; NETWORK DECOMPOSITION; REDUCTION TECHNIQUES;

GRAPH THEORY; ALGORITHMS;

BROOK'S THEOREM; CLUSTER DECOMPOSITION; DISTRIBUTED ALGORITHMS; DISTRIBUTED MODEL OF COMPUTATION; MAXIMAL INDEPENDENT SET; NETWORK DECOMPOSITION PROBLEM; VERTEX COLORING PROBLEM;

EID: 0026995977     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129769     Document Type: Conference Paper

References (17)

1. N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of Algorithms, 7:567-583, 1986.
2. B. Awerbuch. Complexity of network synchronization. J. Assoc. Comput. Mach., 32:804-823, 1985.
3. B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin. Network decomposition and locality in distributed computation. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 364-369, 1989.
4. B. Awerbuch and D. Peleg. Sparse partitions. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 503-513, 1990.
5. B. Awerbuch and D. Peleg. Routing with polynomial communication-space trade-off. SIAM J. on Discrete Mathematics, 5(2), 1992.
6. B. Berger and L. Cowen. Fast deterministic constructions of low-diameter network decompositions. MIT-LCS Technical Memo #460, April 1991.
7. B. Bollobás. Graph Theory. Springer Verlag, New York, 1979.
8. R. Cole and U. Vishkin. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. In ACM Symposium on Theory of Computing, pages 206-219, 1986.
9. A. V. Goldberg, S. A. Plotkin, and G. E. Shannon. Parallel symmetry-breaking in sparse graphs. SIAM J. Disc. Math., 1:434-446, 1989.
10. P. Hajnal and E. Szemerédi. Brooks coloring in parallel. SIAM J. Disc. Math, 3(1l):74-80, 1990.
11. M. Karchmer and J. Naor. A fast parallel algorithm to color a graph with A colors. Journal of Algorithms, 9:83-91, 1988.
12. H. J. Karloff. An NC algorithm for Brooks' theorem. Theoretical Computer Science, 68(1):89-103, 1989.
13. G. F. Lev, N. Pippenger, and L. G. Valiant. A fast parallel algorithm for routing in permutation networks. IEEE Transactions on Computers, 30:93100, 1981.
14. N. Linial. Distributive algorithms- global solutions from local data. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 331-335, 1987.
15. N. Linial and M. Saks. Decomposing graphs into regions of small diameter. In Proceedings of the ACM/SIAM Symposium on Discrete Algorithms, pages 320-330, 1991.
16. M. Luby. A fast parallel algorithm for the maximal independent set problem. SIAM J. Comput., 15(4):1036-1053, 1986.
17. M. Luby. Removing randomness in parallel computation without a processor penalty. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 162-173, 1988.