Coloring random graphs online without creating monochromatic subgraphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Torsten Mütze' in GoogleThis author has not been identified. Look up 'Thomas Rast' in GoogleThis author has not been identified. Look up 'Reto Spöhel' in Google

runs on WebDSL