The random selection of unlabeled graphs

DOI10.1016/0196-6774(83)90021-4zbMath0532.68064OpenAlexW2026261406WikidataQ90910050 ScholiaQ90910050MaRDI QIDQ3315010

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

random graphsefficient algorithmPolya enumeration

Mathematics Subject Classification ID

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

Related Items

Random generation of combinatorial structures from a uniform distribution, Lights Out On A Random Graph, Uniform generation of anonymous and neutral preference profiles for social choice rules, The Impartial, Anonymous, and Neutral Culture Model: A Probability Model for Sampling Public Preference Structures