Generating Random Regular Graphs Quickly

A practical algorithm for generating random regular graphs for all d growing as a small power of n, in the sense that all d-regular graphs on n vertices have in the limit the same probability as n → ∞.