A reconstruction algorithm for L-convex polyominoes

Risultato della ricerca: Article

5 Citazioni (Scopus)

Abstract

We give an algorithm that uniquely reconstruct an L-convex polyomino from the size of some special paths, called bordered L-paths.
Lingua originaleEnglish
pagine (da-a)58-72
Numero di pagine15
RivistaTheoretical Computer Science
Volume356
Stato di pubblicazionePublished - 2006

Fingerprint

Polyominoes
Reconstruction Algorithm
Polyomino
Path

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cita questo

@article{70f04399cae148dca15586703bf9c7ab,
title = "A reconstruction algorithm for L-convex polyominoes",
abstract = "We give an algorithm that uniquely reconstruct an L-convex polyomino from the size of some special paths, called bordered L-paths.",
author = "Antonio Restivo and Giuseppa Castiglione and Roberto Vaglica",
year = "2006",
language = "English",
volume = "356",
pages = "58--72",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - A reconstruction algorithm for L-convex polyominoes

AU - Restivo, Antonio

AU - Castiglione, Giuseppa

AU - Vaglica, Roberto

PY - 2006

Y1 - 2006

N2 - We give an algorithm that uniquely reconstruct an L-convex polyomino from the size of some special paths, called bordered L-paths.

AB - We give an algorithm that uniquely reconstruct an L-convex polyomino from the size of some special paths, called bordered L-paths.

UR - http://hdl.handle.net/10447/26487

M3 - Article

VL - 356

SP - 58

EP - 72

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -