A fast parallel algorithm to color a graph with Δ colors
- 31 March 1988
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 9 (1) , 83-91
- https://doi.org/10.1016/0196-6774(88)90006-5
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A fast parallel coloring of planar graphs with five colorsInformation Processing Letters, 1987
- Efficient parallel algorithms for edge coloring problemsJournal of Algorithms, 1987
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986