| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438822 | Theoretical Computer Science | 2006 | 15 Pages |
Abstract
We give an algorithm that uniquely reconstruct an L-convex polyomino from the size of some special paths, called bordered L-paths.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
