Concepedia

N. C. Wormald

NC

Statistics

Publications

39

Citations

1.7K

H-Index

23

Active since

1982

Affiliations

The University of Melbourne(Current)

University of Waterloo

University of Auckland

University of Newcastle Australia

University of Georgia

N. C. Wormald is an author at The University of Melbourne specializing in graph theory, discrete mathematics, and combinatorial optimization.

Top concepts

Graph TheoryDiscrete MathematicsEngineeringCombinatorial OptimizationNetwork AnalysisEducationNetwork ScienceProbabilityComputational GeometryComputer Science

Publications per year

1982–2010

39

Publications

39

Generating Random Regular Graphs Quickly

Angelika Steger, N. C. Wormald · Combinatorics Probability Computing · 1999 · 230 citations

Engineering, Graph Theory, Random Graph +13

Almost all regular graphs are hamiltonian

Robert W. Robinson, N. C. Wormald · Random Structures and Algorithms · 1994 · 210 citations

Geometric Graph Theory, Graph Theory, Fixed R +8

Almost all cubic graphs are Hamiltonian

Robert W. Robinson, N. C. Wormald · Random Structures and Algorithms · 1992 · 159 citations

Graph Theory, Random Graph, Algebraic Graph Theory +7

Geometric separator theorems and applications

Warren D. Smith, N. C. Wormald · 2002 · 101 citations

Integral Geometry, Mathematical Programming, Engineering +16

Random Graph Processes with Degree Restrictions

Andrzej Ruciński, N. C. Wormald · Combinatorics Probability Computing · 1992 · 98 citations

Engineering, Graph Theory, Random Graph +10

1–5 of 39