Partition Enumeration Algorithms
Partition Enumeration Algorithms is a computational method in partition calculus that systematically generates all possible partitions of a set according to specified structural or combinatorial constraints.
60
Publications
2.6K
Citations
102
Authors
71
Institutions
Publications per year
2017–2026
2
Parents
60
Chain enumeration and non-crossing partitions
Paul H. Edelman · Discrete Mathematics · 1980 · 112 citations
1–5 of 60
102
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 102
71

Centre National de la Recherche Scientifique
Paris, France
5 h-index
9 publications
270 citations

Sorbonne Université
Paris, France
3 h-index
3 publications
122 citations
Laboratoire de Physique Théorique et Hautes Energies
Paris, France
2 h-index
2 publications
68 citations
Laboratoire d'Informatique Algorithmique: Fondements et Applications
Paris, France
2 h-index
3 publications
105 citations
Commissariat à l'Énergie Atomique et aux Énergies Alternatives
Paris, France
2 h-index
2 publications
68 citations
University of Maryland, College Park
College Park, United States
2 h-index
4 publications
45 citations
North Carolina State University
Raleigh, United States
2 h-index
4 publications
66 citations
CEA Paris-Saclay
Gif-sur-Yvette, France
2 h-index
2 publications
68 citations
1–8 of 71
5 publications · 347 citations
5
h-index
5 publications · 205 citations
5
h-index
4 publications · 117 citations
4
h-index
2 publications · 63 citations
2
h-index
MCOM · 2 publications · 46 citations
2
h-index
1–5