Home | english  | Impressum | 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
Tagung:SODA07 Links:PDF
Tagungsort:New Orleans
Datum:January 2007
Autoren:J. Cain, P. Sanders, N. Wormald
Quelle:18th ACM-SIAM Symposium on Discrete Algorithms