Random sampling of large planar maps and convex polyhedra
From MaRDI portal
Publication:2819607
DOI10.1145/301250.301448zbMath1345.05105MaRDI 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
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
On the Asymptotic Number of Plane Curves and Alternating Knots, Transversal structures on triangulations: A combinatorial study and straight-line drawings, Computational study on planar dominating set problem, Generating labeled planar graphs uniformly at random, D?E?K=(1000)8, Random maps, coalescing saddles, singularity analysis, and Airy phenomena