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.
ECO method and the exhaustive generation of convex polyominoes / A.Del Lungo; A.Frosini; S.Rinaldi. - STAMPA. - 2731:(2003), pp. 129-140. (Intervento presentato al convegno Discrete Mathematics and Theoretical Computer Science - DMTCS 2003) [10.1007/3-540-45066-1_10].
ECO method and the exhaustive generation of convex polyominoes
FROSINI, ANDREA;
2003
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.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
[6]congr.pdf
Accesso chiuso
Tipologia:
Versione finale referata (Postprint, Accepted manuscript)
Licenza:
Tutti i diritti riservati
Dimensione
182.33 kB
Formato
Adobe PDF
|
182.33 kB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
