Abstract
We give an algorithm that uniquely reconstruct an L-convex polyomino from the size of some special paths, called bordered L-paths.
Lingua originale | English |
---|---|
pagine (da-a) | 58-72 |
Numero di pagine | 15 |
Rivista | Theoretical Computer Science |
Volume | 356 |
Stato di pubblicazione | Published - 2006 |
All Science Journal Classification (ASJC) codes
- ???subjectarea.asjc.2600.2614???
- ???subjectarea.asjc.1700.1700???