Improving the performance guarantee for approximate graph coloring
- 1 October 1983
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 30 (4) , 729-735
- https://doi.org/10.1145/2157.2158
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- Planar 3-colorability is polynomial completeACM SIGACT News, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Bounded color functions on graphsNetworks, 1972
- A technique for colouring a graph applicable to large scale timetabling problemsThe Computer Journal, 1969