Parallel 5-colouring of planar graphs
- 1 January 1987
- book chapter
- Published by Springer Nature
- p. 304-313
- https://doi.org/10.1007/3-540-18088-5_25
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Parallel symmetry-breaking in sparse graphsPublished by Association for Computing Machinery (ACM) ,1987
- Parallel merge sortPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986
- Efficient plane sweeping in parallelPublished by Association for Computing Machinery (ACM) ,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
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- A linear 5-coloring algorithm of planar graphsJournal of Algorithms, 1981
- A batching method for coloring planar graphsInformation Processing Letters, 1978