Nicholas Wormald
Nicholas Wormald
Professor of Mathematics, Monash University
確認したメール アドレス: monash.edu
タイトル
引用先
引用先
年
Models of random regular graphs
NC Wormald
London Mathematical Society Lecture Note Series, 239-298, 1999
7131999
Sudden emergence of a giantk-core in a random graph
B Pittel, J Spencer, N Wormald
Journal of Combinatorial Theory, Series B 67 (1), 111-151, 1996
4481996
Differential equations for random processes and random graphs
NC Wormald
The annals of applied probability 5 (4), 1217-1235, 1995
4261995
Edge crossings in drawings of bipartite graphs
P Eades, NC Wormald
Algorithmica 11 (4), 379-403, 1994
4081994
The differential equation method for random graph processes and greedy algorithms
NC Wormald
Lectures on approximation and randomized algorithms, 73-155, 1999
2861999
Generating random regular graphs quickly
A Steger, NC Wormald
Combinatorics, Probability and Computing 8 (04), 377-396, 1999
2591999
Almost all regular graphs are Hamiltonian
RW Robinson, NC Wormald
Random Structures and Algorithms 5 (2), 363-374, 1994
2401994
Asymptotic enumeration by degree sequence of graphs with degreeso (n 1/2)
BD McKay, NC Wormald
Combinatorica 11 (4), 369-382, 1991
2251991
Uniform generation of random regular graphs of moderate degree
BD McKay, NC Wormald
Journal of Algorithms 11 (1), 52-67, 1990
1871990
Almost all cubic graphs are Hamiltonian
RW Robinson, NC Wormald
Random Structures & Algorithms 3 (2), 117-125, 1992
1791992
Some problems in the enumeration of labelled graphs
NC Wormald
Bulletin of the Australian Mathematical Society 21 (1), 159-160, 1980
1631980
The asymptotic distribution of short cycles in random regular graphs
NC Wormald
Journal of Combinatorial Theory, Series B 31 (2), 168-182, 1981
1571981
The asymptotic connectivity of labelled regular graphs
NC Wormald
Journal of Combinatorial Theory, Series B 31 (2), 156-167, 1981
1541981
Asymptotic enumeration by degree sequence of graphs of high degree
BD McKay, NC Wormald
European Journal of Combinatorics 11 (6), 565-580, 1990
1271990
Birth control for giants
J Spencer, N Wormald
Combinatorica 27 (5), 587-628, 2007
1182007
Random regular graphs of high degree
M Krivelevich, B Sudakov, VH Vu, NC Wormald
Random Structures and Algorithms 18 (4), 346-363, 2001
1172001
On an edge crossing problem
P Eades, BD McKay, NC Wormald
Proc. 9th Australian Computer Science Conference 327, 334, 1986
1161986
A family of perfect hashing methods
BS Majewski, NC Wormald, G Havas, ZJ Czech
The Computer Journal 39 (6), 547-554, 1996
1111996
Counting connected graphs inside-out
B Pittel, NC Wormald
Journal of Combinatorial Theory, Series B 93 (2), 127-172, 2005
1082005
Random graph processes with degree restrictions
A Rucinski, NC Wormald
Combinatorics, Probability & Computing 1, 169-180, 1992
1061992
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20