Author:
Prömel Hans Jürgen,Taraz Anusch
Publisher
Springer Berlin Heidelberg
Reference44 articles.
1. D. Achlioptas and E. Friedgut, A sharp threshold for k-colorability, Random Structures and Algorithms 14, 63–70, 1999.
2. D. Achlioptas and M. Molloy, The analysis of a list-coloring algorithm on a random graph, in Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 204–212, 1997.
3. E. Friedgut, Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem, Journal of the AMS 12, 1017–1054, 1999.
4. M. Ajtai, J. Komlós, and E. Szemerédi, Sorting in Clogn parallel steps, Combinatorica 3, 1–19, 1983.
5. M.H. Albert and A.M. Frieze, Random graph orders, Order 6, 19–30, 1989.