A Parallel Graph Coloring Heuristic
- 1 May 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 14 (3), 654-669
- https://doi.org/10.1137/0914041
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Scalable iterative solution of sparse linear systemsParallel Computing, 1994
- Automatic Domain Partitioning in Three DimensionsSIAM Journal on Scientific and Statistical Computing, 1991
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- Development of Parallel Methods for a $1024$-Processor HypercubeSIAM Journal on Scientific and Statistical Computing, 1988
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- Estimation of Sparse Jacobian Matrices and Graph Coloring BlemsSIAM Journal on Numerical Analysis, 1983
- New methods to color the vertices of a graphCommunications of the ACM, 1979
- Graph TheoryPublished by Springer Nature ,1979