Download:
|
by Mark Jerrum, Michael Molloy, Robert Robinson, Nicholas Wormald
http://www.cs.uga.edu/~rwr/./publications/random2.ps
Add To MetaCart
Abstract:
cycles in random regular graphs
Citations
|
216
|
Approximating the permanent
– JERRUM, SINCLAIR
- 1989
|
|
204
|
Random generation of combinatorial structures from a uniform distribution," Theoretical Computer Science 43
– Jerrum, Valiant, et al.
- 1986
|
|
99
|
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
– Bollobás
- 1980
|
|
91
|
The asymptotic number of labeled graphs with given degree sequences
– Bender, Canfield
- 1978
|
|
66
|
Almost all regular graphs are hamiltonian, Random Strucures Algorithms 5
– Robinson, Wormald
- 1994
|
|
51
|
Almost all cubic graphs are hamiltonian, Random Structures and Algorithms 3
– Robinson, Wormald
- 1992
|
|
33
|
Optimal algorithms for self-reducible problems
– Schnorr
- 1976
|
|
28
|
A short proof of the factor theorem for finite graphs
– Tutte
- 1954
|
|
25
|
Random regular graphs: Asymptotic distributions and contiguity
– Janson
- 1995
|
|
23
|
Finding Hamilton cycles in sparse random graphs
– Frieze
- 1988
|
|
15
|
all regular graphs are Hamiltonian
– Bollobas
- 1983
|
|
15
|
Hamiltonian cycles in random regular graphs
– Fenner, Frieze
- 1984
|
|
12
|
cycles in random regular digraphs
– Cooper, Frieze, et al.
- 1994
|
|
4
|
A.M.Frieze and E.Shamir, Finding hidden Hamilton cycles Random Structures and Algorithms 5
– Broder
- 1994
|
|
2
|
A short proof of the factor theorem for graphs
– Tutte
- 1954
|
