Generating Random Regular Graphs Quickly
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 → ∞. Th...
Gespeichert in:
| Veröffentlicht in: | Combinatorics, probability & computing probability & computing, 1999-07, Vol.8 (4), p.377-396 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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 ds
is [Oscr ](nd2). |
|---|---|
| ISSN: | 0963-5483 1469-2163 |
| DOI: | 10.1017/S0963548399003867 |