Author:
Coja-Oghlan Amin,Moore Cristopher,Sanwalani Vishal
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Achlioptas, D. and Friedgut, E.: A sharp threshold for k-colorability. Random Structures & Algorithms 14 (1999) 63–70.
2. Lect Notes Comput Sci;A. Bertoni,1997
3. Coja-Oghlan, A. and Taraz, A.: Colouring random graphs in expected polynomial time. Proc. 20th STACS (2003) 487–498
4. Coppersmith, D., Gamarnik, D., Hajiaghayi, M., Sorkin, G.B.: Random MAX SAT, random MAX CUT, and their phase transitions. Proc. 14th SODA (2003) 329–337
5. Delorme, C. and Poljak, S.: Laplacian eigenvalues and the maximum cut problem. Math. Programming 62 (1993) 557–574.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献