Generating Random Unlabelled Graphs

DOI10.1137/0216048zbMath0634.68067OpenAlexW2012541231MaRDI QIDQ3773364

Nicholas C. Wormald

Publication date: 1987

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0216048

zbMATH Keywords

enumerationrandom graphuniform generationunlabelled graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)

Related Items (5)

Approximate counting, uniform generation and rapidly mixing Markov chains ⋮ Random and uniform generation of words ⋮ Fast uniform generation of regular graphs ⋮ Non-uniform random generation of generalized Motzkin paths ⋮ A separator-based method for generating weakly chordal graphs

This page was built for publication: Generating Random Unlabelled Graphs