Colouring Random Graphs in Expected Polynomial Time

Amin Coja-Oghlan, Anusch Taraz. Colouring Random Graphs in Expected Polynomial Time. In Helmut Alt, Michel Habib, editors, STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings. Volume 2607 of Lecture Notes in Computer Science, pages 487-498, Springer, 2003. [doi]

Abstract

Abstract is missing.