The DOI matches its Crossref record.
A Parallel Graph Coloring Heuristic
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Efficient Management of Parallelism in Object-Oriented Numerical Software Libraries
Balay, S., Gropp, W. D., McInnes, L. C., & Smith, B. F. (1997) · Modern Software Tools for Scientific Computing · doi:10.1007/978-1-4612-1986-6_8 · Cited by 2,009
BoomerAMG: A parallel algebraic multigrid solver and preconditioner
Henson, V. E., & Yang, U. M. (2002) · Applied Numerical Mathematics · doi:10.1016/s0168-9274(01)00115-5 · Cited by 885
hypre: A Library of High Performance Preconditioners
Falgout, R. D., & Yang, U. M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47789-6_66 · Cited by 867
Parallel multilevel k-way partitioning scheme for irregular graphs
Karypis, G., & Kumar, V. (1996) · Proceedings of the 1996 ACM/IEEE conference on Supercomputing · doi:10.1145/369028.369103 · Cited by 310
PETSc/TAO Users Manual (Rev. 3.19)
Argonne National Laboratory (ANL), A., Balay, S., USDOE Office of Science (SC), A. S. C. R. (., Abhyankar, S., Adams, M., Benson, S., Brown, J., Brune, P., Buschelman, K., Constantinescu, E., et al. (2023) · doi:10.2172/1968587 · Cited by 67
Metadata
- Authors
- Jones, M. T., & Plassmann, P. E.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 1993-05
- Volume
- 14
- Issue
- 3
- Pages
- 654-669
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W1994182141
- Cited by
- 227
- References
- 0
- FWCI
- 6.52
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Parallel Graph Coloring Heuristic. https://app.cochat.ai/papers/10.1137/0914041
- The paper
- Jones, M. T., & Plassmann, P. E. (1993). A Parallel Graph Coloring Heuristic. SIAM Journal on Scientific Computing. https://doi.org/10.1137/0914041
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.