Hypergraph Enumeration
Hypergraph Enumeration is a combinatorial method that systematically generates and counts all non-isomorphic hypergraphs over a given set of vertices, distinguished by its focus on exhaustively cataloging hypergraph structures according to specified structural constraints and symmetries.
43
Publications
1.3K
Citations
90
Authors
57
Institutions
Publications per year
2017–2026
7
Parents
43
Discovering all most specific sentences
Dimitrios Gunopulos, Roni Khardon, Heikki Mannila et al. · ACM Transactions on Database Systems · 2003 · 215 citations
Transversal numbers for hypergraphs arising in geometry
Noga Alon, Gil Kalai, Jiřı́ Matoušek et al. · Advances in Applied Mathematics · 2002 · 94 citations
1–5 of 43
90
4
h-index
3
h-index
Rutgers, The State University of New Jersey, United States
3 publications · 103 citations
3
h-index
Rutgers, The State University of New Jersey, United States
3 publications · 103 citations
3
h-index
2
h-index
1–5 of 90
57
Rutgers, The State University of New Jersey
New Brunswick, United States
5 h-index
10 publications
243 citations
Max Planck Society
Munich, Germany
4 h-index
4 publications
133 citations
Universidade de São Paulo
São Paulo, Brazil
3 h-index
7 publications
263 citations
Institute for Information Transmission Problems
Moscow, Russia
2 h-index
2 publications
33 citations
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
2 publications
162 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
4 publications
40 citations
Humboldt-Universität zu Berlin
Berlin, Germany
2 h-index
6 publications
245 citations

UNSW Sydney
Sydney, Australia
2 h-index
3 publications
50 citations
1–8 of 57
7 publications · 188 citations
7
h-index
4 publications · 77 citations
4
h-index
2 publications · 100 citations
2
h-index
2 publications · 95 citations
2
h-index
2 publications · 34 citations
2
h-index
1–5