Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1002/rsa.v35:4 | Random Struct. Algorithms |
Keywords | Field | DocType |
random sampling,time complexity,planar graph,planar graphs,linear approximation,generating function,linear time | Discrete mathematics,Generating function,Combinatorics,Random graph,Bijection,Vertex (geometry),Analysis of algorithms,Sampling (statistics),Time complexity,Mathematics,Planar graph | Journal |
Volume | Issue | ISSN |
35 | 4 | 1042-9832 |
Citations | PageRank | References |
12 | 0.70 | 17 |
Authors | ||
1 | ||