Geodesic
Quadratic exact-size and linear approximate-size random generation of planar graphs
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms (2005).

Voir la notice de l'article provenant de la source Episciences

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)$. 
@article{DMTCS_2005_special_249_a10,
     author = {Fusy, Eric},
     title = {Quadratic exact-size and linear approximate-size random generation of planar graphs},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms},
     year = {2005},
     doi = {10.46298/dmtcs.3362},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3362/}
}
TY  - JOUR
AU  - Fusy, Eric
TI  - Quadratic exact-size and linear approximate-size random generation of planar graphs
JO  - Discrete mathematics & theoretical computer science
PY  - 2005
VL  - DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3362/
DO  - 10.46298/dmtcs.3362
LA  - en
ID  - DMTCS_2005_special_249_a10
ER  - 
%0 Journal Article
%A Fusy, Eric
%T Quadratic exact-size and linear approximate-size random generation of planar graphs
%J Discrete mathematics & theoretical computer science
%D 2005
%V DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3362/
%R 10.46298/dmtcs.3362
%G en
%F DMTCS_2005_special_249_a10
Fusy, Eric. Quadratic exact-size and linear approximate-size random generation of planar graphs. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms (2005). doi : 10.46298/dmtcs.3362. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3362/

Cité par Sources :