# Generating Tatami Coverings Efficiently

@article{Erickson2014GeneratingTC, title={Generating Tatami Coverings Efficiently}, author={Alejandro Erickson and Frank Ruskey}, journal={arXiv: Combinatorics}, year={2014} }

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

#### Citations

##### Publications citing this paper.

## Monte Carlo estimation of the number of tatami tilings

VIEW 1 EXCERPT

CITES METHODS

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 15 REFERENCES

## Monomino-Domino Tatami Coverings

VIEW 3 EXCERPTS

## Counting Fixed-Height Tatami Tilings

VIEW 1 EXCERPT

## Monomer-Dimer Tatami Tilings of Rectangular Regions

VIEW 5 EXCERPTS

## Complexity of Cycle Transverse Matching Problems

VIEW 1 EXCERPT

## Monomer-dimer tatami tilings of square regions

VIEW 3 EXCERPTS