The random graph threshold for <i>k</i>-orientiability and a fast algorithm for optimal multiple-choice allocation.

Julie Anne Cain Peter Sanders 0001 Nicholas C. Wormald The random graph threshold for <i>k</i>-orientiability and a fast algorithm for optimal multiple-choice allocation. 469-476 2007 conf/soda/2007 SODA http://dl.acm.org/citation.cfm?id=1283383.1283433 db/conf/soda/soda2007.html#CainSW07