Graph coloring on coarse grained multicomputers
- 6 September 2003
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 131 (1) , 179-198
- https://doi.org/10.1016/s0166-218x(02)00424-9
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERSInternational Journal of Computational Geometry & Applications, 1996
- A Parallel Graph Coloring HeuristicSIAM Journal on Scientific Computing, 1993
- A bridging model for parallel computationCommunications of the ACM, 1990
- Brooks Coloring in ParallelSIAM Journal on Discrete Mathematics, 1990
- An NC algorithm for Brooks' TheoremTheoretical Computer Science, 1989
- A fast parallel algorithm to color a graph with Δ colorsJournal of Algorithms, 1988
- A fast parallel coloring of planar graphs with five colorsInformation Processing Letters, 1987
- 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
- Register allocation via coloringComputer Languages, 1981