Abstract: We present a practical algorithm for generating random regular graphs. For all d growing as a small power of n , the d -regular graphs on n vertices are generated approximately uniformly at random, in the sense that all d -regular graphs on n vertices have in the limit the same probability as n → ∞. The expected runtime for these d s is [Oscr ]( nd 2 ).
Publication Year: 1999
Publication Date: 1999-07-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 229
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot