Online vertex colorings of random graphs without monochromatic subgraphs

Martin Marciniszyn, Reto Spöhel. Online vertex colorings of random graphs without monochromatic subgraphs. In Nikhil Bansal, Kirk Pruhs, Clifford Stein, editors, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. pages 486-493, SIAM, 2007. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.