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

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)$.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [11 references]

https://hal.inria.fr/hal-01184034
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Wednesday, August 12, 2015 - 3:52:02 PM
Last modification on : Thursday, February 3, 2022 - 11:18:45 AM
Long-term archiving on: : Friday, November 13, 2015 - 11:40:25 AM

### File

Publisher files allowed on an open archive

### 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, ⟨10.46298/dmtcs.3362⟩. ⟨hal-01184034⟩

Record views