scientific article; zbMATH DE number 6472600
From MaRDI portal
Publication:5501803
zbMath1321.68323MaRDI QIDQ5501803
Publication date: 14 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) 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) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (13)
Watermelon uniform random generation with applications ⋮ Maximum matchings in planar graphs via Gaussian elimination ⋮ \(q\)-distributions on boxed plane partitions ⋮ Bijecting hidden symmetries for skew staircase shapes ⋮ Generalized domino-shuffling. ⋮ Beyond windability: approximability of the four-vertex model ⋮ Stationary determinantal processes: phase multiplicity, Bernoullicity, entropy, and domination ⋮ Mixing times of lozenge tiling and card shuffling Markov chains ⋮ An optimal algorithm to generate tilings ⋮ Shuffling algorithm for boxed plane partitions ⋮ Another involution principle-free bijective proof of Stanley's hook-content formula ⋮ Tractable minor-free generalization of planar zero-field Ising models ⋮ How quickly can we sample a uniform domino tiling of the \(2L\times 2L\) square via Glauber dynamics?
This page was built for publication:
