Home | deutsch  | Legals | Sitemap | KIT

The Random Graph Threshold for k-orientiability and a Fast Algorithm for Optimal Multiple-Choice Allocation

The Random Graph Threshold for k-orientiability and a Fast Algorithm for Optimal Multiple-Choice Allocation
Conference:SODA07 Links:PDF
Location:New Orleans
Date:January 2007
Author(s):J. Cain, P. Sanders, N. Wormald
Source:18th ACM-SIAM Symposium on Discrete Algorithms