Uniform Generation of Random Regular Graphs of Moderate Degree
暂无分享,去创建一个
[1] Nicholas C. Wormald,et al. The asymptotic distribution of short cycles in random regular graphs , 1981, J. Comb. Theory, Ser. B.
[2] Mark Jerrum,et al. Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, International Workshop on Graph-Theoretic Concepts in Computer Science.
[3] Mark Jerrum,et al. Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, WG.
[4] Nicholas C. Wormald. The asymptotic connectivity of labelled regular graphs , 1981, J. Comb. Theory, Ser. B.
[5] Nicholas C. Wormald,et al. Generating Random Regular Graphs , 1984, J. Algorithms.
[6] Béla Bollobás,et al. Random Graphs , 1985 .
[7] Brendan D. McKay,et al. Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2) , 1991, Comb..