Abstract
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. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Del Lungo, A., Frosini, A., & Rinaldi, S. (2003). ECO method and the exhaustive generation of convex polyominoes. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2731, 129–140. https://doi.org/10.1007/3-540-45066-1_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
