The random selection of unlabeled graphs
From MaRDI portal
Publication:3315010
DOI10.1016/0196-6774(83)90021-4zbMATH Open0532.68064OpenAlexW2026261406WikidataQ90910050 ScholiaQ90910050MaRDI QIDQ3315010FDOQ3315010
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30)
Cited In (22)
- Random generation and enumeration of bipartite permutation graphs
- Constructing finite unlabeled structures using group actions
- Title not available (Why is that?)
- Uniform generation of unlabelled graphs
- Orderly algorithm to enumerate central groupoids and their graphs
- A program generating homogeneous random graphs with given weights
- Fast canonical labeling of random subgraphs
- Random generation of combinatorial structures from a uniform distribution
- On the structure of random unlabelled acyclic graphs.
- Generating Random Unlabelled Graphs
- Random Generation and Enumeration of Proper Interval Graphs
- On the Rigidity of Sparse Random Graphs
- The impartial, anonymous, and neutral culture model: a probability model for sampling public preference structures
- The ‘Burnside Process’ Converges Slowly
- Algorithms for generating labelled graphs with given degree
- Lights Out On A Random Graph
- Uniform generation of anonymous and neutral preference profiles for social choice rules
- Cataloging graphs by generating them uniformly at random
- On Non-Eliminative Structuralism. Unlabeled Graphs as a Case Study, Part B†
- Efficient algorithms for listing unlabeled graphs
- Randomly Sampling Molecules
- Random Graph Isomorphism
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)
