We give an algorithm that uniquely reconstruct an L-convex polyomino from the size of some special paths, called bordered L-paths.
CASTIGLIONE G, RESTIVO A, VAGLICA R (2006). A reconstruction algorithm for L-convex polyominoes. THEORETICAL COMPUTER SCIENCE, 356(1-2), 58-72 [10.1016/j.tcs.2006.01.045].
A reconstruction algorithm for L-convex polyominoes
CASTIGLIONE, Giuseppa;RESTIVO, Antonio;VAGLICA, Roberto
2006-01-01
Abstract
We give an algorithm that uniquely reconstruct an L-convex polyomino from the size of some special paths, called bordered L-paths.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
restivo.pdf
Solo gestori archvio
Dimensione
355.73 kB
Formato
Adobe PDF
|
355.73 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
