RCN algorithms for the uniform generation of combinatorial structures

M Zito, I Pu, M Amos and A Gibbons, ``RNC algorithms for the uniform generation of combinatorial structures'', The Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA `96). ISBN-08987-13668, Atlanta, Georgia, USA, 1 1996.

[1]  Gottfried Tinhofer,et al.  Generating graphs uniformly at random , 1990 .

[2]  Nicholas C. Wormald,et al.  Generating Random Unlabelled Graphs , 1987, SIAM J. Comput..

[3]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[4]  Mark Jerrum,et al.  Fast Uniform Generation of Regular Graphs , 1990, Theor. Comput. Sci..

[5]  A. Gibbons.  Algorithmic Graph Theory , 1985 .

[6]  Jörg-Rüdiger Sack,et al.  Uniform Generation of Binary Trees in Parallel , 1994, J. Parallel Distributed Comput..

[7]  Noam Nisan,et al.  Fast connected components algorithms for the EREW PRAM , 1992, SPAA '92.

[8]  Alan Slomson.  Introduction to Combinatorics , 1997 .

[9]  Claus-Peter Schnorr,et al.  Optimal Algorithms for Self-Reducible Problems , 1976, ICALP.

[10]  Ivan Stojmenovic.  On random and adaptive parallel generation of combinatorial objects , 1992, Int. J. Comput. Math..

[11]  Andrei Z. Broder,et al.  Generating random spanning trees , 1989, 30th Annual Symposium on Foundations of Computer Science.

[12]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[13]  David Aldous,et al.  The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees , 1990, SIAM J. Discret. Math..

[14]  Mark Jerrum,et al.  Uniform Sampling Modulo a Group of Symmetries Using Markov Chain Simulation , 1992, Expanding Graphs.

[15]  Alistair Sinclair,et al.  Algorithms for Random Generation and Counting: A Markov Chain Approach , 1993, Progress in Theoretical Computer Science.

[16]  Wojciech Rytter,et al.  Efficient parallel algorithms , 1988 .

[17]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[18]  Frank Harary,et al.  Graphical enumeration , 1973 .

[19]  J. Rotman.  The theory of groups : an introduction , 1966 .

[20]  Anna R. Karlin,et al.  Bounds on the cover time , 1989 .

[21]  I. Parberry,et al.  Two Fast Parallel Prime Number Sieves , 1994, Inf. Comput..