Skip to Main content Skip to Navigation
Conference papers

Quadratic exact-size and linear approximate-size random generation of planar graphs

Eric Fusy 1
1 ALGORITHMS - Algorithms
Inria Paris-Rocquencourt
Abstract : This extended abstract introduces a new algorithm for the 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 judicious 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. Then, for each generation, the time complexity is quadratic for exact-size uniform sampling and linear for 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 $\mathcal{O}(n^7)$.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01184034
Contributor : Coordination Episciences Iam <>
Submitted on : Wednesday, August 12, 2015 - 3:52:02 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Friday, November 13, 2015 - 11:40:25 AM

File

dmAD0112.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01184034, version 1

Collections

Citation

Eric Fusy. Quadratic exact-size and linear approximate-size random generation of planar graphs. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.125-138. ⟨hal-01184034⟩

Share

Metrics

Record views

263

Files downloads

613