Probabilistic analysis of a heuristic graph coloring algorithm
- 1 January 1982
- journal article
- Published by Wiley in Electronics and Communications in Japan (Part I: Communications)
- Vol. 65 (6) , 12-18
- https://doi.org/10.1002/ecja.4410650603
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- On colouring random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1975
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972