Random sampling of large planar maps and convex polyhedra
From MaRDI portal
Publication:2819607
DOI10.1145/301250.301448zbMath1345.05105OpenAlexW2155929119MaRDI QIDQ2819607
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
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (14)
Generating labeled planar graphs uniformly at random ⋮ An axiomatic characterization of the Brownian map ⋮ A Markov Chain Sampler for Plane Curves ⋮ Practical algorithms for branch-decompositions of planar graphs ⋮ Cycle-based formulations in distance geometry ⋮ Phase transitions in graphs on orientable surfaces ⋮ Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments ⋮ On the Asymptotic Number of Plane Curves and Alternating Knots ⋮ D?E?K=(1000)8 ⋮ Random maps, coalescing saddles, singularity analysis, and Airy phenomena ⋮ A bijection for essentially 3-connected toroidal maps ⋮ Transversal structures on triangulations: A combinatorial study and straight-line drawings ⋮ Computational study on planar dominating set problem ⋮ Asymptotic laws for random knot diagrams
This page was built for publication: Random sampling of large planar maps and convex polyhedra
