The random selection of unlabeled graphs

DOI10.1016/0196-6774(83)90021-4MaRDI QIDQ3315010zbMATH OpenOpenAlexWikidataFDO

Authors Herbert S. Wilf, John D. Dixon

Publication date 1983

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(83)90021-4

zbMATH Keywords

efficient algorithmPolya enumerationrandom graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Uniform generation of unlabelled graphs
• Generating Random Unlabelled Graphs
• Cataloging graphs by generating them uniformly at random
• Fast uniform generation of regular graphs
• Generating random regular graphs

Cited in

(26)

• Random generation of combinatorial structures from a uniform distribution
• Algorithms for generating labelled graphs with given degree
• On the structure of random unlabelled acyclic graphs.
• Constructing finite unlabeled structures using group actions
• Fast canonical labeling of random subgraphs
• The impartial, anonymous, and neutral culture model: a probability model for sampling public preference structures
• Cataloging graphs by generating them uniformly at random
• Random Generation and Enumeration of Proper Interval Graphs
• Uniform generation of anonymous and neutral preference profiles for social choice rules
• Generating Random Unlabelled Graphs
• Random Graph Isomorphism
• scientific article; zbMATH DE number 15335 (Why is no real title available?)
• Efficient algorithms for listing unlabeled graphs
• Random generation and enumeration of bipartite permutation graphs
• scientific article; zbMATH DE number 1301969 (Why is no real title available?)
• The ‘Burnside Process’ Converges Slowly
• Isomorph-Free Exhaustive Generation
• scientific article; zbMATH DE number 871941 (Why is no real title available?)
• Randomly Sampling Molecules
• Lights Out On A Random Graph
• On Non-Eliminative Structuralism. Unlabeled Graphs as a Case Study, Part B†
• On the Rigidity of Sparse Random Graphs
• Uniform generation of unlabelled graphs
• A program generating homogeneous random graphs with given weights
• Sampling unlabeled chordal graphs in expected polynomial time
• Orderly algorithm to enumerate central groupoids and their graphs

This page was built for publication: The random selection of unlabeled graphs

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