The random graph threshold for ::::k::::-orientiability and a fast algorithm for optimal multiple-choice allocation

Julie Anne Cain, Peter Sanders, Nicholas C. Wormald. The random graph threshold for ::::k::::-orientiability and a fast algorithm for optimal multiple-choice allocation. 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 469-476, SIAM, 2007. [doi]

Abstract

Abstract is missing.