. Allwright, A comparison of parallel graph coloring algorithms, 1995.

. Culler, LogP: Towards a Realistic Model of Parallel Computation, Proceeding of 4-th ACM SIGPLAN Symp. on Principles and Practises of Parallel Programming, pp.1-12, 1993.

. Dehne, SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS, International Journal of Computational Geometry & Applications, vol.06, issue.03, pp.379-400, 1996.
DOI : 10.1142/S0218195996000241

I. Gebremedhin, . Manne, A. H. Gebremedhin, and F. Manne, Parallel graph coloring algorithms using OpenMP (extended abstract), First European Workshop on OpenMP, pp.10-18, 1999.

M. Gebremedhin, A. H. Gebremedhin, and F. Manne, Scalable, shared memory parallel graph coloring heuristics, 1999.

. Goudreau, Towards efficiency and portability, Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures , SPAA '96, pp.1-12, 1996.
DOI : 10.1145/237502.237503

[. Lassous, Feasability, portability, predictability and efficiency: Four ambitious goals for the design and implementation of parallel coarse grained graph algorithms, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00072768

L. G. Valiant, A bridging model for parallel computation, Communications of the ACM, vol.33, issue.8, pp.103-111, 1990.
DOI : 10.1145/79173.79181

R. , U. De-recherche, I. Lorraine, V. Technopôle-de-nancy-brabois, I. Lès-nancy-unité-de-recherche et al., Campus scientifique, 615 rue du Jardin Botanique Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unité de recherche INRIA Rhône-Alpes, p.78153, 2004.