scientific article; zbMATH DE number 6472600
From MaRDI portal
Publication:5501803
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)
Cited in
(13)- Shuffling algorithm for boxed plane partitions
- Generalized domino-shuffling.
- Stationary determinantal processes: phase multiplicity, Bernoullicity, entropy, and domination
- Mixing times of lozenge tiling and card shuffling Markov chains
- Another involution principle-free bijective proof of Stanley's hook-content formula
- Watermelon uniform random generation with applications
- How quickly can we sample a uniform domino tiling of the \(2L\times 2L\) square via Glauber dynamics?
- Maximum matchings in planar graphs via Gaussian elimination
- An optimal algorithm to generate tilings
- Tractable minor-free generalization of planar zero-field Ising models
- \(q\)-distributions on boxed plane partitions
- Bijecting hidden symmetries for skew staircase shapes
- Beyond windability: approximability of the four-vertex model
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501803)
