scientific article; zbMATH DE number 5050599

MaRDI QIDQ5485334zbMATH OpenFDO

Authors Éric Fusy

Publication date 29 August 2006

zbMATH Keywords

Boltzmann samplersplanar graphsrejection sampling

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Uniform random sampling of planar graphs in linear time
• Generating Random Hyperbolic Graphs in Subquadratic Time
• Random planar graphs and the number of planar graphs
• Random planar graphs and beyond
• scientific article; zbMATH DE number 2038777
• Generating labeled planar graphs uniformly at random
• Approximating the diameter of planar graphs in near linear time
• Approximating the Diameter of Planar Graphs in Near Linear Time
• Linear-time generation of random chordal graphs
• Generalized quasirandom graphs

Cited in

(12)

• Generating labeled planar graphs uniformly at random
• Random sampling of large planar maps and convex polyhedra
• An experimental study on generating planar graphs
• Uniform random sampling of planar graphs in linear time
• Asymptotic enumeration and limit laws of planar graphs
• scientific article; zbMATH DE number 2038777 (Why is no real title available?)
• Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory
• Distributed computation of virtual coordinates for greedy routing in sensor networks
• Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
• Exact-Size Sampling of Enriched Trees in Linear Time
• On properties of random dissections and triangulations
• Random graphs on surfaces

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485334)