Optimal Parallel 5-Colouring of Planar Graphs
- 1 April 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (2) , 288-300
- https://doi.org/10.1137/0218020
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Fast parallel vertex colouringPublished by Springer Nature ,2006
- A fast parallel algorithm for six-colouring of planar graphsPublished by Springer Nature ,2005
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Coloring planar graphs in parallelJournal of Algorithms, 1987
- A fast parallel coloring of planar graphs with five colorsInformation Processing Letters, 1987
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986
- A Linear Algorithm for Colouring Planar Graphs with Five ColoursThe Computer Journal, 1985
- On linear-time algorithms for five-coloring planar graphsInformation Processing Letters, 1984
- A linear 5-coloring algorithm of planar graphsJournal of Algorithms, 1981
- A batching method for coloring planar graphsInformation Processing Letters, 1978