Random sampling of large planar maps and convex polyhedra

DOI10.1145/301250.301448MaRDI QIDQ2819607zbMATH OpenOpenAlexFDO

Authors Gilles Schaeffer

Publication date 29 September 2016

Published in Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/301250.301448

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) 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
• scientific article; zbMATH DE number 2038777
• Generating labeled planar graphs uniformly at random
• A direct decomposition of 3-connected planar graphs
• scientific article; zbMATH DE number 5050599

Cited in

(27)

• Transversal structures on triangulations: A combinatorial study and straight-line drawings
• Computational study on planar dominating set problem
• Plane sampling
• A bijection for essentially 3-connected toroidal maps
• Generating labeled planar graphs uniformly at random
• A direct decomposition of 3-connected planar graphs
• An axiomatic characterization of the Brownian map
• D E K=(100)_8
• Random maps, coalescing saddles, singularity analysis, and Airy phenomena
• Dissections and trees, with applications to optimal mesh encoding and to random sampling
• Drawing planar cubic 3-connected graphs with few segments: algorithms \& experiments
• Random Sampling of Plane Partitions
• On the Asymptotic Number of Plane Curves and Alternating Knots
• scientific article; zbMATH DE number 1859219 (Why is no real title available?)
• scientific article; zbMATH DE number 1418277 (Why is no real title available?)
• Quadratic Maps Are Hard to Sample
• A Markov Chain Sampler for Plane Curves
• Phase transitions in graphs on orientable surfaces
• Sampling of Planar Curves: Theory and Fast Algorithms
• Asymptotic laws for random knot diagrams
• Growing uniform planar maps face by face
• Cycle-based formulations in distance geometry
• Uniform sampling of fixed size polyominoes
• On universal singular exponents in equations with one catalytic parameter of order one (extended abstract)
• Unified study of the phase transition for block-weighted random planar maps (extended abstract)
• A bijection between non-separable planar maps and fighting fish
• Practical algorithms for branch-decompositions of planar graphs

This page was built for publication: Random sampling of large planar maps and convex polyhedra

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