A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
Random sampling of large planar maps and convex polyhedra
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Uniform random generation of decomposable structures using floating-point arithmetic
Theoretical Computer Science - Special issue on Caen '97
A bijection for triangulations of a polygon with interior points and multiple edges
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Boltzmann Samplers for the Random Generation of Combinatorial Structures
Combinatorics, Probability and Computing
Journal of Combinatorial Theory Series B
Random planar graphs with n nodes and a fixed number of edges
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal Coding and Sampling of Triangulations
Algorithmica
Generating labeled planar graphs uniformly at random
Theoretical Computer Science
Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
ACM Transactions on Algorithms (TALG)
Analytic Combinatorics
Random sampling of plane partitions
Combinatorics, Probability and Computing
Degree distribution in random planar graphs
Journal of Combinatorial Theory Series A
An experimental study on generating planar graphs
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Asymptotic Study of Subcritical Graph Classes
SIAM Journal on Discrete Mathematics
A distance measure between labeled combinatorial maps
Computer Vision and Image Understanding
Planar preprocessing for spring embedders
GD'12 Proceedings of the 20th international conference on Graph Drawing
Hi-index | 0.00 |
This article introduces new algorithms for the uniform random generation of labelled planar graphs. Its principles rely on Boltzmann samplers, as recently developed by Duchon, Flajolet, Louchard, and Schaeffer. It combines the Boltzmann framework, a suitable use of rejection, a new combinatorial bijection found by Fusy, Poulalhon, and Schaeffer, as well as a precise analytic description of the generating functions counting planar graphs, which was recently obtained by Giménez and Noy. This gives rise to an extremely efficient algorithm for the random generation of planar graphs. There is a preprocessing step of some fixed small cost; and the expected time complexity of generation is quadratic for exact-size uniform sampling and linear for uniform approximate-size sampling. This greatly improves on the best previously known time complexity for exact-size uniform sampling of planar graphs with n vertices, which was a little over O(n7). © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009 This is the extended and revised journal version of a conference paper with the title “Quadratic exact-size and linear approximate-size random generation of planar graphs”, which appeared in the Proceedings of the International Conference on Analysis of Algorithms (AofA'05), 6–10 June 2005, Barcelona.