On the exhaustive generation of plane partitions

被引：1

作者：

Mantaci, R. ^{[1
]}

Massazza, P. ^{[2
]}

机构：

[1] Uniyersite Paris Diderot Paris 7, LIAFA, CNRS UMR 7089, F-75205 Paris 13, France

[2] Univ Insubria, Dipartimento Sci Teor & Applicate, I-21100 Varese, Italy

来源：

THEORETICAL COMPUTER SCIENCE | 2013年 / 502卷

关键词：

Integer partitions; Exhaustive generation; CAT algorithms;

D O I：

10.1016/j.tcs.2012.11.013

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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. (C) 2012 Elsevier B.V. All rights reserved.

引用

页码：153 / 164

页数：12

共 7 条

[1]

Duchi E, 2007, PU M A, V17, P71

[2]

Hindenburg C.F., 1779, Infinitinomii Dignitatum Exponentis Indeterminati, P73

[3]

Knuth D. E., 2011, ART COMPUTER PRO A 1, V4A

[4]

Mantaci Roberto, 2011, Developments in Language Theory. Proceedings 15th International Conference, DLT 2011, P350, DOI 10.1007/978-3-642-22321-1_30

[5] A CAT ALGORITHM FOR THE EXHAUSTIVE GENERATION OF ICE PILES [J].

Massazza, Paolo ;

Radicioni, Roberto .

RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2010, 44 (04) :525-543

[6]

Ruskey F., 2003, COMBINATORI IN PRESS

[7] Fast algorithms for generating integer partitions [J].

Zoghbi, A ;

Stojmenovic, I .

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1998, 70 (02) :319-332

← 1 →