Scalable parallel graph coloring algorithms
- 1 October 2000
- journal article
- research article
- Published by Wiley in Concurrency: Practice and Experience
- Vol. 12 (12) , 1131-1146
- https://doi.org/10.1002/1096-9128(200010)12:12<1131::aid-cpe528>3.0.co;2-2
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Parallel Heuristics for Improved, Balanced Graph ColoringsJournal of Parallel and Distributed Computing, 1996
- A Parallel Graph Coloring HeuristicSIAM Journal on Scientific Computing, 1993
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- Some lower bounds for a class of frequency assignment problemsIEEE Transactions on Vehicular Technology, 1986
- Estimation of Sparse Jacobian Matrices and Graph Coloring BlemsSIAM Journal on Numerical Analysis, 1983
- Register allocation via coloringComputer Languages, 1981
- New methods to color the vertices of a graphCommunications of the ACM, 1979
- An application of graph coloring to printed circuit testingIEEE Transactions on Circuits and Systems, 1976
- On colouring random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1975
- An upper bound for the chromatic number of a graph and its application to timetabling problemsThe Computer Journal, 1967