A fast parallel algorithm for six-colouring of planar graphs
- 13 November 2005
- book chapter
- Published by Springer Nature
- p. 273-282
- https://doi.org/10.1007/bfb0016251
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Finding biconnected componemts and computing tree functions in logarithmic parallel timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Sorting inc logn parallel stepsCombinatorica, 1983
- Parallel computation and conflicts in memory accessInformation Processing Letters, 1982
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982