On the public citation graph

Uniform random sampling of planar graphs in linear time

0 signed · 67 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-2972-8_8openalex-snapshot
2-Isomorphic Graphs
inferredcites →https://doi.org/10.1007/978-3-319-44543-4openalex-snapshot
On Maximal Chain Subgraphs and Covers of Bipartite Graphs.
inferredcites →https://doi.org/10.1007/978-3-319-78825-8openalex-snapshot
Combinatorial Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-88244-2_13openalex-snapshot
The Degree Distribution of Random Planar Graphs
inferredcites →https://doi.org/10.1007/s00373-006-0647-2openalex-snapshot
Planar Graphs, via Well-Orderly Maps and Trees
inferredcites →https://doi.org/10.1007/s00453-006-0114-8openalex-snapshot
Optimal Coding and Sampling of Triangulations
inferredcites →https://doi.org/10.1016/0095-8956(82)90072-7openalex-snapshot
Counting labelled three-connected and homeomorphically irreducible two-connected graphs
inferredcites →https://doi.org/10.1016/0095-8956(84)90033-9openalex-snapshot
The asymptotic enumeration of rooted convex polyhedra
inferredcites →https://doi.org/10.1016/0097-3165(82)90061-9openalex-snapshot
Helly-type theorems for pseudoline arrangements in P2
inferredcites →https://doi.org/10.1016/0304-3975(94)90226-7openalex-snapshot
A calculus for the random generation of labelled combinatorial structures
inferredcites →https://doi.org/10.1016/c2013-0-10826-4openalex-snapshot
Graphical Enumeration
inferredcites →https://doi.org/10.1016/j.disc.2007.12.093openalex-snapshot
Transversal structures on triangulations: A combinatorial study and straight-line drawings
inferredcites →https://doi.org/10.1016/j.jctb.2004.09.007openalex-snapshot
Random planar graphs
inferredcites →https://doi.org/10.1016/j.tcs.2007.02.045openalex-snapshot
Generating labeled planar graphs uniformly at random
inferredcites →https://doi.org/10.1016/s0021-9800(68)80007-9openalex-snapshot
The enumeration of c-nets via quadrangulations
inferredcites →https://doi.org/10.1016/s0304-3975(03)00226-3openalex-snapshot
A bijection for triangulations of a polygon with interior points and multiple edges
inferredcites →https://doi.org/10.1016/s0304-3975(98)00323-5openalex-snapshot
Uniform random generation of decomposable structures using floating-point arithmetic
inferredcites →https://doi.org/10.1017/cbo9780511801655openalex-snapshot
Analytic Combinatorics
inferredcites →https://doi.org/10.1017/cbo9781107325913openalex-snapshot
Combinatorial Species and Tree-like Structures
inferredcites →https://doi.org/10.1017/s0963548304006315openalex-snapshot
Boltzmann Samplers for the Random Generation of Combinatorial Structures
inferredcites →https://doi.org/10.1017/s0963548309990332openalex-snapshot
Random Sampling of Plane Partitions
inferredcites →https://doi.org/10.1090/s0894-0347-08-00624-3openalex-snapshot
Asymptotic enumeration and limit laws of planar graphs
inferredcites →https://doi.org/10.1137/0403019openalex-snapshot
Singularity Analysis of Generating Functions
inferredcites →https://doi.org/10.1137/1.9781611972979.5openalex-snapshot
Boltzmann Sampling of Unlabelled Structures
inferredcites →https://doi.org/10.1145/1361192.1361196openalex-snapshot
Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
inferredcites →https://doi.org/10.1145/301250.301448openalex-snapshot
Random sampling of large planar maps and convex polyhedra
inferredcites →https://doi.org/10.2307/2371127openalex-snapshot
2-Isomorphic Graphs
inferredcites →https://doi.org/10.3138/9781487584863openalex-snapshot
Connectivity in Graphs
inferredcites →https://doi.org/10.37236/1659openalex-snapshot
The Number of Labeled 2-Connected Planar Graphs
inferredcites →https://doi.org/10.37236/1662openalex-snapshot
A Note on Odd Cycle-Complete Graph Ramsey Numbers
inferredcites →https://doi.org/10.37236/1822openalex-snapshot
Planar Maps as Labeled Mobiles
inferredcites →https://doi.org/10.4153/cjm-1963-029-xopenalex-snapshot
A Census of Planar Maps
inferredcites →https://doi.org/10.46298/dmtcs.3362openalex-snapshot
Quadratic exact-size and linear approximate-size random generation of planar graphs
inferredcites →https://doi.org/10.46298/dmtcs.3562openalex-snapshot
Degree distribution in random planar graphs
inferredcites →https://doi.org/10.46298/dmtcs.3585openalex-snapshot
Boltzmann Oracle for Combinatorial Systems
inferredcites →https://doi.org/10.5555/1070432.1070576openalex-snapshot
Random planar graphs with n nodes and a fixed number of edges

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rsa.20900openalex-snapshot
Phase transitions in graphs on orientable surfaces
inferred← citeshttps://doi.org/10.1002/rsa.21199openalex-snapshot
Random graphs embeddable in order‐dependent surfaces
inferred← citeshttps://doi.org/10.1007/978-3-642-21204-8_39openalex-snapshot
An Experimental Study on Generating Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_35openalex-snapshot
Planar Preprocessing for Spring Embedders
inferred← citeshttps://doi.org/10.1007/s00453-010-9446-5openalex-snapshot
A Linear Algorithm for the Random Sampling from Regular Languages
inferred← citeshttps://doi.org/10.1007/s10601-018-9288-3openalex-snapshot
Intruder alert! Optimization models for solving the mobile robot graph-clear problem
inferred← citeshttps://doi.org/10.1016/j.aam.2014.04.001openalex-snapshot
Analytic combinatorics of chord and hyperchord diagrams with k crossings
inferred← citeshttps://doi.org/10.1016/j.artint.2026.104506openalex-snapshot
Domain-independent dynamic programming
inferred← citeshttps://doi.org/10.1016/j.cviu.2012.08.002openalex-snapshot
A distance measure between labeled combinatorial maps
inferred← citeshttps://doi.org/10.1016/j.endm.2017.06.061openalex-snapshot
The Evolution of Random Graphs on Surfaces
inferred← citeshttps://doi.org/10.1016/j.jcta.2011.04.010openalex-snapshot
Degree distribution in random planar graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.05.005openalex-snapshot
Concentration of maximum degree in random planar graphs
inferred← citeshttps://doi.org/10.1016/j.neucom.2014.12.058openalex-snapshot
An error-tolerant approximate matching algorithm for labeled combinatorial maps
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.09.002openalex-snapshot
Explore and repair graphs with black holes using mobile entities
inferred← citeshttps://doi.org/10.1017/9781009036214.005openalex-snapshot
Generating graphs randomly
inferred← citeshttps://doi.org/10.1017/cbo9781316479988openalex-snapshot
Random Graphs, Geometry and Asymptotic Structure
inferred← citeshttps://doi.org/10.1017/cbo9781316479988.003openalex-snapshot
Random graphs from restricted classes
inferred← citeshttps://doi.org/10.1088/1751-8113/43/38/385001openalex-snapshot
A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings
inferred← citeshttps://doi.org/10.1103/physrevresearch.2.013217openalex-snapshot
Existence of life in 2 + 1 dimensions
inferred← citeshttps://doi.org/10.1109/srds51746.2020.00009openalex-snapshot
Benefits of Stabilization versus Rollback in Self-Stabilizing Graph-Based Applications on Eventually Consistent Key-Value Stores
inferred← citeshttps://doi.org/10.1112/plms/pdu024openalex-snapshot
The maximum degree of random planar graphs
inferred← citeshttps://doi.org/10.1137/1.9781611973204.5openalex-snapshot
A bijection for plane graphs and its applications
inferred← citeshttps://doi.org/10.1137/100790161openalex-snapshot
Asymptotic Study of Subcritical Graph Classes
inferred← citeshttps://doi.org/10.1137/21m1459733openalex-snapshot
Exact-Size Sampling of Enriched Trees in Linear Time
inferred← citeshttps://doi.org/10.1201/9781003033707-16openalex-snapshot
Recent Advances in Scalable Network Generation1
inferred← citeshttps://doi.org/10.21248/gups.61035openalex-snapshot
Scalable generation of random graphs
inferred← citeshttps://doi.org/10.22331/q-2021-03-15-410openalex-snapshot
Hyper-optimized tensor network contraction
inferred← citeshttps://doi.org/10.37236/7640openalex-snapshot
Random Planar Maps and Graphs with Minimum Degree Two and Three
inferred← citeshttps://doi.org/10.5070/c63160417openalex-snapshot
Classes of graphs embeddable in order-dependent surfaces
inferred← citeshttps://doi.org/10.5821/dissertation-2117-107956openalex-snapshot
Graph enumeration and random graphs
inferred← citeshttps://doi.org/10.70675/fb6e5ba1zdd53z4bb8z9c87z0fca48edcebdopenalex-snapshot
Unified study of block-weighted planar maps : combinatorial and probabilistic properties
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.