Experimental analysis of simple, distributed vertex coloring algorithms (extended abstract)

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 606-615

  Finocchi, Irene ^a   Panconesi, Alessandro ^a   Silvestri, Riccardo ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION ROUNDS; EXPERIMENTAL ANALYSIS; EXPERIMENTAL EVALUATION; EXTENDED ABSTRACTS; INDEPENDENT SET; RANDOMIZED ALGORITHMS; RELATIVE PERFORMANCE; VERTEX COLORING;

ALGORITHMS;

EID: 33847124752     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. J.R. Allwright, R. Bordawekar, RD. Coddington, K. Dincer, and C.L. Martin. A Comparison of Parallel Graph Coloring Algorithms. Technical Report SCCS-666, Northeast Parallel Architecture Center, Syracuse University, 1995.
2. S. Basagni, Finding a maximal weighted independent set in wireless networks, Telecommunication Systems, 18:1, 2, 155-168, 2001.
3. B. Bollobas. Chromatic number, girth, and maximal degree. Discrete Mathematics 24:311-314, 1978.
4. D. Brelaz. New Methods to Color Vertices of a Graph. Communications of the ACM, 22:251-256, 1979.
5. S. Chaudhuri and D. Dubhashi. Probabilistic recurrence relations revisited. Theoretical Computer Science, to appear.
6. T.F. Coleman and J.J. More. Estimation of Sparse Jacobian Matrices and Graph Coloring Problems. SIAM Journal on Numerical Analysis, 20:187-209, 1983.
7. J.C. Culberson, http://web.cs.ualberta.ca/-30e/Coloring/.
8. FTP site of DIMACS implementation challenges. ftp://dimacs. rutgers. edu/pub/challenge/.
9. A.H. Gebremedhin and F. Marine. Scalable Parallel Graph Coloring Algorithms. Concurrency: Practice and Experience, 12:1131-1146, 2000.
10. D.A. Grable and A. Panconesi. Fast distributed algorithms for Brooks-Vizing colourings. Journal of Algorithms, 37:85-120, 2000. Special issue for SODA 98, the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms.
11. D.A. Grable and A. Panconesi. Nearly optimal distributed edge colouring in O(loglogn) rounds. Random Structures and Algorithms, 10(3):385-405, 1997. Preliminary version in Proceedings of the Eight Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 97).
12. G.R. Grimmet and C.J.H. McDiarmid. On Colouring Random Graphs. Mathematical Proceedings of the Cambridge Philosophical Society, 77:313-324, 1975.
13. D.S. Johnson and M.A. Trick. Cliques, Coloring, and Satisfiability, volume 26 of DIM ACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1996.
14. A.R. Johansson. Asymptotic choice number for triangle-free graphs. Preprint, DIMACS, September 30, 1996.
15. O. Johansson. Simple distributed A + 1-coloring of graphs. Information Processing Letters 70:229-232, 1999.
16. M.T. Jones and P.E. Plassmann. A Parallel Graph Coloring Heuristics. SIAM Journal on Scientific Computing, 14(3):654-669, 1993.
17. R.M. Karp. Probabilistic recurrence relations. In proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC 91), 190-197, 1991.
18. J.H.Kim, On Brooks' Theorem for sparse graphs, Combinatorics Probability and Computing, 4 (1995) 97-132.
19. J. Körner. Private communication.
20. G. Lewandowski and A. Condon. Experiments with Parallel Graph Coloring Heuristics and Applications of Graph Coloring. Cliques, Coloring, and Satisfiability, volume 26 of DIM ACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1996.
21. M. Luby. Removing randomness in parallel without processor penality. Journal of Computer and System Sciences, 47(2):250-286, 1993.
22. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing, 15:1036-1053, 1986.
23. M.V. Marathe, A. Panconesi, and L.D. Risinger jr. An Experimental Study of a Simple, Distributed Edge Coloring Algorithm. In proceedings of the 12th ACM Symposium on Parallel Algorithms and Architectures (SPAA'00), 166-175, 2000.
24. P. Sinha, R. Sivakumar, and V. Bharghavan, Enhancing ad hoc routing with dynamical virtual infrastructures, Proceedings of IEEE Infocom 2001, 1-10.
25. P. Sinha, R. Sivakumar, and V. Bharghavan, CEDAR: a core-extraction distributed ad-hoc routing algorithms, IEEE Journal on Selected Areas in Communication, 17, 8, 1454-1458, August 1999.