Fast Uniform Generation of Regular Graphs
暂无分享,去创建一个
[1] Edward A. Bender,et al. The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.
[2] D. Aldous. Random walks on finite groups and rapidly mixing markov chains , 1983 .
[3] Mark Jerrum,et al. Approximating the Permanent , 1989, SIAM J. Comput..
[4] Leslie G. Valiant,et al. Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..
[5] Nicholas C. Wormald,et al. Generating Random Unlabelled Graphs , 1987, SIAM J. Comput..
[6] Béla Bollobás,et al. Random Graphs , 1985 .
[7] A. Sinclair. Randomised algorithms for counting and generating combinatorial structures , 1988 .
[8] L. Lovász. Combinatorial problems and exercises , 1979 .
[9] Mark Jerrum,et al. Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, International Workshop on Graph-Theoretic Concepts in Computer Science.
[10] Brendan D. McKay,et al. Uniform Generation of Random Regular Graphs of Moderate Degree , 1990, J. Algorithms.
[11] Nicholas C. Wormald,et al. Generating Random Regular Graphs , 1984, J. Algorithms.
[12] Martin E. Dyer,et al. A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies , 1989, STOC.
[13] Béla Bollobás,et al. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..