A note on domino shuffling
The electronic journal of combinatorics, Tome 13 (2006)
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification is specially tailored to deal with cases when some of the weights are zero. This allows us to tile efficiently a large class of planar graphs, by embedding them in a large enough Aztec diamond. We also give a sufficient condition on the size of the latter diamond for the algorithm to succeed.
DOI :
10.37236/1056
Classification :
05B45, 05C70, 52C20, 68R10
Mots-clés : perfect matchings, Aztec diamonds, planar graphs, algorithm
Mots-clés : perfect matchings, Aztec diamonds, planar graphs, algorithm
@article{10_37236_1056,
author = {\'E. Janvresse and T. de la Rue and Y. Velenik},
title = {A note on domino shuffling},
journal = {The electronic journal of combinatorics},
year = {2006},
volume = {13},
doi = {10.37236/1056},
zbl = {1097.05013},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1056/}
}
É. Janvresse; T. de la Rue; Y. Velenik. A note on domino shuffling. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1056
Cité par Sources :