Scalable parallel graph coloring algorithms

Finding a good graph coloring quickly is often a crucial phase in the development of efficient, parallel algorithms for many scientific and engineering applications. In this paper we consider the problem of solving the graph coloring problem itself in parallel. We present a simple and fast parallel...

Full description

Bibliographic Details

Published in:	Concurrency (Chichester, England.) Vol. 12; no. 12; pp. 1131 - 1146
Main Authors:	Gebremedhin, Assefaw Hadish, Manne, Fredrik
Format:	Journal Article
Language:	English
Published:	Chichester, UK John Wiley & Sons, Ltd 01.10.2000
Subjects:	graph coloring OpenMP parallel algorithms shared memory programming
ISSN:	1040-3108, 1096-9128
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!