Coloring planar graphs in parallel
- 31 December 1987
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 8 (4) , 470-479
- https://doi.org/10.1016/0196-6774(87)90046-0
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Efficient parallel algorithms for edge coloring problemsJournal of Algorithms, 1987
- On linear-time algorithms for five-coloring planar graphsInformation Processing Letters, 1984
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- A linear 5-coloring algorithm of planar graphsJournal of Algorithms, 1981
- A fast parallel algorithm for routing in permutation networksIEEE Transactions on Computers, 1981