The problem of computing good graph colorings arises in many diverse applications, such as in the estimation of sparse Jacobians and in the development of efficient, parallel iterative methods for solving sparse linear systems. This paper presents an asynchronous graph coloring heuristic well suited to distributed memory parallel computers. Experimental results obtained on an Intel iPSC/860 are presented, which demonstrate that, for graphs arising from finite element applications, the heuristic exhibits scalable performance and generates colorings usually within three or four colors of the best-known linear time sequential heuristics. For bounded degree graphs, it is shown that the expected running time of the heuristic under the P-RAM computation model is bounded by $EO(\log (n)/\log \log (n))$. This bound is an improvement over the previously known best upper bound for the expected running time of a random heuristic for the graph coloring problem.
[1]
Alex Pothen,et al.
PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS*
,
1990
.
[2]
David S. Johnson,et al.
Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran
,
1979
.
[3]
Daniel Brélaz,et al.
New methods to color the vertices of a graph
,
1979,
CACM.
[4]
J. J. Moré,et al.
Estimation of sparse jacobian matrices and graph coloring problems
,
1983
.
[5]
Michael Luby,et al.
A simple parallel algorithm for the maximal independent set problem
,
1985,
STOC '85.
[6]
Robert E. Benner,et al.
Development of Parallel Methods for a $1024$-Processor Hypercube
,
1988
.
[7]
Stephen A. Vavasis,et al.
Automatic Domain Partitioning in Three Dimensions
,
1991,
SIAM J. Sci. Comput..
[8]
Mark T. Jones,et al.
Scalable Iterative Solution of Sparse Linear Systems
,
1994,
Parallel Comput..