Institut für Theoretische Informatik, Algorithmik II

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

  • Tagung:SODA07
  • Tagungsort:New Orleans
  • Datum:January 2007
  • Autoren:J. Cain, P. Sanders, N. Wormald
  • Quelle:18th ACM-SIAM Symposium on Discrete Algorithms