Quadratic exact-size and linear approximate-size random generation of planar graphs
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...
Main Author: | Eric Fusy |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2005-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3362/pdf |
Similar Items
-
Randomized Optimization: a Probabilistic Analysis
by: Jean Cardinal, et al.
Published: (2007-01-01) -
HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm
by: Philippe Flajolet, et al.
Published: (2007-01-01) -
Convex hull for intersections of random lines
by: Daniel Berend, et al.
Published: (2005-01-01) -
Tail Bounds for the Wiener Index of Random Trees
by: Tämur Ali Khan, et al.
Published: (2007-01-01) -
Asymptotics of Riordan arrays
by: Mark C. Wilson
Published: (2005-01-01)