Coloring random graphs online without creating monochromatic subgraphs

Torsten Mütze, Thomas Rast, Reto Spöhel. Coloring random graphs online without creating monochromatic subgraphs. In Dana Randall, editor, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011. pages 145-158, SIAM, 2011. [doi]

Abstract

Abstract is missing.