Parallel Heuristics for Improved, Balanced Graph Colorings

  title={Parallel Heuristics for Improved, Balanced Graph Colorings},
  author={Robert K. Gjertsen and Mark T. Jones and Paul E. Plassmann},
  journal={J. Parallel Distrib. Comput.},
The computation of good, balanced graph colorings is an essential part of many algorithms required in scientiic and engineering applications. Motivated by an eeective sequential heuristic, we introduce a new parallel heuristic, PLF, and show that this heuristic has the same expected runtime under the PRAM computational model as the scalable coloring heuristic introduced by Jones and Plassmann (JP). We present experimental results performed on the Intel DELTA that demonstrate that this new… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 21 extracted citations


Publications referenced by this paper.
Showing 1-10 of 19 references

elaz, New methods to color the vertices of a graph

  • D. Br
  • Comm. ACM,
  • 1979
Highly Influential
8 Excerpts

An upper bound for the chromatic number of a graph and its application to timetabling problems

  • D. Welsh, M. Powell
  • Comput. J., 10
  • 1967
Highly Influential
8 Excerpts

Estimation of sparse Jacobian matrices and graph coloring problems

  • T. F. Coleman, J. J. Mor e
  • SIAM Journal on Numerical Analysis,
  • 1983
Highly Influential
9 Excerpts

Parallel graph coloring heuristics, Master's thesis, University of Illinois at Urbana

  • R. K. Gjertsen
  • 1994
1 Excerpt

Thermal e ects on the frequency response of piezoelectric crystals

  • T. Canfield, M. Jones, P. Plassmann, M. Tang
  • New Methods in Transient Analysis, PVP-Vol. 246…
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…