Coloring random graphs
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 284-291
- https://doi.org/10.1007/3-540-55706-7_24
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Some tools for approximate 3-coloringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- 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
- Generating quasi-random sequences from semi-random sourcesJournal of Computer and System Sciences, 1986