Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
