A reconstruction algorithm for L-convex polyominoes

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

We give an algorithm that uniquely reconstruct an L-convex polyomino from the size of some special paths, called bordered L-paths.
Original languageEnglish
Pages (from-to)58-72
Number of pages15
JournalTheoretical Computer Science
Volume356
Publication statusPublished - 2006

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A reconstruction algorithm for L-convex polyominoes'. Together they form a unique fingerprint.

  • Cite this