Pages that link to "Item:Q2819607"
From MaRDI portal
The following pages link to Random sampling of large planar maps and convex polyhedra (Q2819607):
Displaying 22 items.
- Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
- Transversal structures on triangulations: A combinatorial study and straight-line drawings (Q1011766) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- Plane sampling (Q1075708) (← links)
- A bijection for essentially 3-connected toroidal maps (Q2033922) (← links)
- Generating labeled planar graphs uniformly at random (Q2373725) (← links)
- A direct decomposition of 3-connected planar graphs (Q2654584) (← links)
- An axiomatic characterization of the Brownian map (Q2660431) (← links)
- \(D\cdot E\cdot K=(100)_8\) (Q2772918) (← links)
- Random maps, coalescing saddles, singularity analysis, and Airy phenomena (Q2772920) (← links)
- Dissections and trees, with applications to optimal mesh encoding and to random sampling (Q2921729) (← links)
- Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments (Q2985120) (← links)
- Random Sampling of Plane Partitions (Q3557534) (← links)
- On the Asymptotic Number of Plane Curves and Alternating Knots (Q4663079) (← links)
- (Q4789202) (← links)
- (Q4941837) (← links)
- Quadratic Maps Are Hard to Sample (Q4973863) (← links)
- A Markov Chain Sampler for Plane Curves (Q5094488) (← links)
- Phase transitions in graphs on orientable surfaces (Q5128754) (← links)
- Sampling of Planar Curves: Theory and Fast Algorithms (Q5212699) (← links)
- Asymptotic laws for random knot diagrams (Q5272615) (← links)
- Cycle-based formulations in distance geometry (Q6114894) (← links)
