ECO method and the exhaustive generation of convex polyominoes
2003
ECO is a method for the enumeration of classes of combinatorial objects based on recursive constructions of such classes. In this paper we use the ECO method and the concept of succession rule to develop an algorithm for the exhaustive generation of convex polyominoes. Then we prove that this algorithm runs in constant amortized time.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
18
References
12
Citations
NaN
KQI