An experimental analysis of simple, distributed vertex coloring algorithms

Algorithmica (New York)

Volumn 41, Issue 1, 2004, Pages 1-23

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

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Algorithm engineering; Distributed graph algorithms; Vertex coloring

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; GRAPH THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; MATHEMATICAL PROGRAMMING; PROBABILITY DISTRIBUTIONS;

ALGORITHM ENGINEERING; DISTRIBUTED GRAPH ALGORITHMS; VERTEX COLORING;

ALGORITHMS;

EID: 10844265377     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1104-3     Document Type: Article

References (27)

1. J.R. Allwright, R. Bordawekar, P.D. 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. Bollobás. Chromatic number, girth, and maximal degree. Discrete Mathematics, 24:311-314, 1978.
4. D. Brélaz. 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. Moré. 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/~joe/Coloring/.
8. FTP site of DIMACS implementation challenges. ftp://dimacs.rutgers.edu/ pub/challenge/.
9. A.H. Gebremedhin and F. Manne. 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 (log log n) 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. M. Gradinariu and S. Tixeuil. Self-stabilizing vertex coloration and arbitrary graphs. In Proceedings of the 4th International Conference on Principles of Distributed Systems, pp. 55-70, 2000.
13. G.R. Grimmet and C.J.H. McDiarmid. On colouring random graphs. Mathematical Proceedings of the Cambridge Philosophical Society, 77:313-324, 1975.
14. S.T. Hedetniemi, D.P. Jacobs, and P.K. Srimani. Linear time self-stabilizing colorings. Information Processing Letters, 87:251-255, 2003.
15. A.R. Johansson. Asymptotic choice number for triangle-free graphs. Preprint, DIMACS, September 30, 1996.
16. Ö. Johansson. Simple distributed (Δ + 1)-coloring of graphs. Information Processing Letters, 70:229-232, 1999.
17. D.S. Johnson and M.A. Trick. Cliques, Coloring, and Satisfiability. Volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence, RI, 1996.
18. M.T. Jones and P.E. Plassmann. A parallel graph coloring heuristics. SIAM Journal on Scientific Computing, 14(3):654-669, 1993.
19. R.M. Karp. Probabilistic recurrence relations. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC 91), pp. 190-197, 1991.
20. J.H.Kim, On Brooks' theorem for sparse graphs. Combinatorics Probability and Computing, 4:97-132, 1995.
21. J. Körner. Private communication.
22. G. Lewandowski and A. Condon. Experiments with parallel graph coloring heuristics and applications of graph coloring. In D.S. Johnson and M.A. Trick (eds.), Cliques, Coloring, and Satisfiability. Volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence, RI, 1996.
23. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing, 15:1036-1053, 1986.
24. M. Luby. Removing randomness in parallel without processor penalty. Journal of Computer and System Sciences, 47(2):250-286, 1993.
25. 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), pp. 166-175, 2000.
26. 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.
27. P. Sinha, R. Sivakumar, and V. Bharghavan. Enhancing ad hoc routing with dynamical virtual infrastructures. Proceedings of IEEE Infocom 2001, pp. 1-10.