Generating Random Unlabelled Graphs

DOI10.1137/0216048MaRDI QIDQ3773364zbMATH OpenOpenAlexFDO

Authors Nicholas 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

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

Recommendations

• Uniform generation of unlabelled graphs
• The random selection of unlabeled graphs
• Generating random regular graphs
• Generating Random Regular Graphs Quickly
• scientific article; zbMATH DE number 15335

Cited in

(17)

• Approximate counting, uniform generation and rapidly mixing Markov chains
• Algorithms for generating labelled graphs with given degree
• Generating realistic labelled, weighted random graphs
• Random and uniform generation of words
• Non-uniform random generation of generalized Motzkin paths
• The random selection of unlabeled graphs
• scientific article; zbMATH DE number 4057541 (Why is no real title available?)
• Efficient algorithms for listing unlabeled graphs
• On the Rigidity of Sparse Random Graphs
• Uniform generation of unlabelled graphs
• A separator-based method for generating weakly chordal graphs
• Generating random regular graphs
• Generating random regular graphs
• A program generating homogeneous random graphs with given weights
• An algorithm for uniform generation of unlabeled (Pólya) trees
• Sampling unlabeled chordal graphs in expected polynomial time
• Fast uniform generation of regular graphs

This page was built for publication: Generating Random Unlabelled Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3773364)