Generating random regular graphs quickly

被引：148
|
作者：
Steger, A [1 ]
Wormald, NC
机构：
[1] Tech Univ Munich, Inst Informat, D-80290 Munich, Germany
[2] Univ Melbourne, Dept Math & Stat, Parkville, Vic 3052, Australia
来源：
COMBINATORICS PROBABILITY & COMPUTING | 1999年 / 8卷 / 04期
关键词：
D O I：
10.1017/S0963548399003867
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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 --> infinity. The expected runtime for these ds is O(nd(2)).
引用
收藏
页码：377 / 396
页数：20
相关论文
共 50 条
  • [1] Generating random regular graphs
    Kim, J. H.
    Vu, V. H.
    [J]. COMBINATORICA, 2006, 26 (06) : 683 - 708
  • [2] Generating Random Regular Graphs
    J. H. Kim
    V. H. Vu*
    [J]. Combinatorica, 2006, 26 : 683 - 708
  • [3] GENERATING RANDOM REGULAR GRAPHS
    WORMALD, NC
    [J]. JOURNAL OF ALGORITHMS, 1984, 5 (02) : 247 - 280
  • [4] Generating and counting Hamilton cycles in random regular graphs
    Frieze, A
    Jerrum, M
    Molloy, M
    Robinson, R
    Wormald, N
    [J]. JOURNAL OF ALGORITHMS, 1996, 21 (01) : 176 - 198
  • [5] On the asymmetry of random regular graphs and random graphs
    Kim, JH
    Sudakov, B
    Vu, VH
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2002, 21 (3-4) : 216 - 224
  • [6] Generating regular directed graphs
    Brinkmann, Gunnar
    [J]. DISCRETE MATHEMATICS, 2013, 313 (01) : 1 - 7
  • [7] Generating r-regular graphs
    Ding, GL
    Chen, P
    [J]. DISCRETE APPLIED MATHEMATICS, 2003, 129 (2-3) : 329 - 343
  • [8] Sandwiching random regular graphs between binomial random graphs
    Gao, Pu
    Isaev, Mikhail
    McKay, Brendan D.
    [J]. PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 690 - 701
  • [9] Sandwiching random regular graphs between binomial random graphs
    Gao, Pu
    Isaev, Mikhail
    McKay, Brendan D.
    [J]. PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 690 - 701
  • [10] Generating connected random graphs
    Gray, Caitlin
    Mitchell, Lewis
    Roughan, Matthew
    [J]. JOURNAL OF COMPLEX NETWORKS, 2019, 7 (06) : 896 - 912
12345