On the exhaustive generation of plane partitions

Authors:
R. Mantaci;P. Massazza
Affiliations:
LIAFA, CNRS UMR 7089, Université Paris Diderot - Paris 7, Case 7014, 75205 Paris Cedex 13, France;Universití degli Studi dell'Insubria, Dipartimento di Scienze Teoriche e Applicate, Via Mazzini 5, 21100 Varese, Italy
Venue:
Theoretical Computer Science
Year:
2013

Citing 2
Cited 0

The Art of Computer Programming: Combinatorial Algorithms, Part 1

The Art of Computer Programming: Combinatorial Algorithms, Part 1
From linear partitions to parallelogram polyominoes

DLT'11 Proceedings of the 15th international conference on Developments in language theory

Quantified Score

Hi-index	5.23

Visualization

Abstract

We present a CAT (Constant Amortized Time) algorithm for generating all plane partitions of an integer n, that is, all integer matrices with non-increasing rows and columns having sum n.