An NC algorithm for Brooks' Theorem
- 16 October 1989
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 68 (1) , 89-103
- https://doi.org/10.1016/0304-3975(89)90121-7
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Brooks Coloring in ParallelSIAM Journal on Discrete Mathematics, 1990
- A fast parallel algorithm to color a graph with Δ colorsJournal of Algorithms, 1988
- Coloring planar graphs in parallelJournal of Algorithms, 1987
- A new parallel algorithm for the maximal independent set problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Efficient parallel algorithms for edge coloring problemsJournal of Algorithms, 1987