JOURNAL ARTICLE
Cataloging graphs by generating them uniformly at random
Adalbert KerberReinhard LaueR. W. HagerWarren E. Weber
Year: 1990 Journal: Journal of Graph Theory Vol: 14 (5)Pages: 559-563 Publisher: Wiley
Abstract
Abstract We describe an algorithm for cataloging graphs by generating them uniformly at random. The method used is based on a recent algorithm by Dixon and Wilf that generates orbit representatives uniformly at random. The approach is refined to graphs with prescribed numbers of edges and vertices, and then applied to obtain the complete list of graphs on 10 vertices.
Keywords:
Combinatorics Mathematics Cataloging Random graph Discrete mathematics Indifference graph Graph Computer science World Wide Web
Metrics
5
Cited By
0.49
FWCI (Field Weighted Citation Impact)
5
Refs
0.65
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Complex Network Analysis Techniques
Physical Sciences → Physics and Astronomy → Statistical and Nonlinear Physics
Graph Theory and Algorithms
Physical Sciences → Computer Science → Computer Vision and Pattern Recognition
Related Documents
BOOK-CHAPTER
Generating Graphs Uniformly at Random
Computing. Supplementum Year: 1990 Pages: 235-255
JOURNAL ARTICLE
Generating Outerplanar Graphs Uniformly at Random
Journal: Combinatorics Probability Computing Year: 2006 Vol: 15 (3)Pages: 333-343
JOURNAL ARTICLE
Generating labeled planar graphs uniformly at random
Manuel BodirskyClemens GröplMihyun Kang
Journal: Theoretical Computer Science Year: 2007 Vol: 379 (3)Pages: 377-386
BOOK-CHAPTER
Generating Labeled Planar Graphs Uniformly at Random
Manuel BodirskyClemens GröplMihyun Kang
Lecture notes in computer science Year: 2003 Pages: 1095-1107
JOURNAL ARTICLE
Generating unlabeled connected cubic planar graphs uniformly at random
Manuel BodirskyClemens GröplMihyun Kang
Journal: Random Structures and Algorithms Year: 2008 Vol: 32 (2)Pages: 157-180