Coloring random graphs in polynomial expected time
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Some tools for approximate 3-coloringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the hardness of approximating minimization problemsPublished by Association for Computing Machinery (ACM) ,1993
- Coloring random graphsPublished by Springer Nature ,1992
- The solution of some random NP-hard problems in polynomial expected timeJournal of Algorithms, 1989
- Almost all k-colorable graphs are easy to colorJournal of Algorithms, 1988