A heuristic approach to domino grid problem
From MaRDI portal
Publication:6089319
DOI10.1007/s13226-022-00321-xOpenAlexW4296097356MaRDI QIDQ6089319
Vasif V. Nabiyev, Hüseyin Pehlivan
Publication date: 14 December 2023
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13226-022-00321-x
Exact enumeration problems, generating functions (05A15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domino tilings and related models: Space of configurations of domains with holes
- Alternating-sign matrices and domino tilings. I
- Domino tilings with barriers
- Tiling with bars under tomographic constraints.
- An \(O(n \log n)\)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded.
- Lambda-determinants and domino-tilings
- Perfect matchings of generalized polyomino graphs
- A note on domino shuffling
- The reconstruction of a subclass of domino tilings from two projections
- The statistics of dimers on a lattice
- Statistical Mechanics of Dimers on a Plane Lattice
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Games solved: Now and in the future
This page was built for publication: A heuristic approach to domino grid problem
