Quadratic exact-size and linear approximate-size random generation of planar graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

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

Eric Fusy
  • Function : Author

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)$.
Fichier principal
Vignette du fichier
dmAD0112.pdf (205.76 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184034 , version 1 (12-08-2015)

Identifiers

Cite

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⟩
120 View
505 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More