Skip to main content
Conference Proceedings

From linear partitions to parallelogram polyominoes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6795 LNCS 350-361
DOI: 10.1007/978-3-642-22321-1_30
12Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We provide a bijection between parallelogram polyominoes and suitable pairs of linear partitions. This lets us design a CAT (Constant Amortized Time) algorithm for generating all parallelogram polyominoes of size n using space. © 2011 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Mantaci, R., & Massazza, P. (2011). From linear partitions to parallelogram polyominoes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6795 LNCS, pp. 350–361). https://doi.org/10.1007/978-3-642-22321-1_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free