Corpus ID: 118428301

Generating Tatami Coverings Efficiently

@article{Erickson2014GeneratingTC,
  title={Generating Tatami Coverings Efficiently},
  author={Alejandro Erickson and Frank Ruskey},
  journal={arXiv: Combinatorics},
  year={2014}
}
  • Alejandro Erickson, Frank Ruskey
  • Published 2014
  • Mathematics
  • arXiv: Combinatorics
  • We present two algorithms to list certain classes of monomino-domino coverings which conform to the \emph{tatami} restriction; no four tiles meet. Our methods exploit structural features of tatami coverings in order to create the lists in $O(1)$ time per covering. This is faster than known methods for generating certain classes of matchings in bipartite graphs. We discuss tatami coverings of $n\times n$ grids with $n$ monominoes and $v$ vertical dominoes, as well as tatami coverings of a two… CONTINUE READING

    Figures from this paper.

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 15 REFERENCES