Domino tilings and related models: Space of configurations of domains with holes
From MaRDI portal
Publication:596048
DOI10.1016/j.tcs.2004.02.020zbMath1043.05032arXivmath/0302344OpenAlexW2046267131MaRDI QIDQ596048
Eric Rémila, Sébastien Desreux, Martin Matamala, Ivan Rapaport
Publication date: 10 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0302344
Related Items
A note on the structure of spaces of domino tilings ⋮ A heuristic approach to domino grid problem ⋮ An optimal algorithm to generate tilings
Cites Work
- Tiling groups: New applications in the triangular lattice
- Combinatorics of perfect matchings in plane bipartite graphs and application to tilings.
- An \(O(n \log n)\)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded.
- An algorithm to generate exactly once every tiling with lozenges of a domain.
- Mixing times of lozenge tiling and card shuffling Markov chains
- Tiling with polyominoes and combinatorial group theory
- Spaces of domino tilings
- A variational principle for domino tilings
- Conway's Tiling Groups
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Depth-First Search and Linear Graph Algorithms
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Domino tilings and related models: Space of configurations of domains with holes
