Generating Random Regular Graphs

This paper analyzes a simple algorithm introduced by Steger and Wormald and proves that it produces an asymptotically uniform random regular graph in a polynomial time, confirming a conjecture of Wormald.