Hypergraph Theory
Hypergraph Theory is a branch of combinatorics that generalizes graph theory by studying set systems in which edges, called hyperedges, can connect any number of vertices, thereby modeling higher-order relationships beyond pairwise interactions.
2.7K
Publications
118.9K
Citations
4.1K
Authors
1.5K
Institutions
Publications per year
2017–2026
674
2.7K
Choice Reviews Online · 1995 · 1.3K citations
New algorithms for fast discovery of association rules
Mohammed J. Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara et al. · 1997 · 1.1K citations
Lise Getoor, Christopher Diehl · ACM SIGKDD Explorations Newsletter · 2005 · 977 citations
1–5 of 2.7K
4.1K
28
h-index
20
h-index
20
h-index
20
h-index
University of Illinois Urbana-Champaign, United States
29 publications · 934 citations
19
h-index
1–5 of 4.1K
1.5K

Hungarian Academy of Sciences
Budapest, Hungary
35 h-index
107 publications
5.2K citations
University of Illinois Urbana-Champaign
Urbana, United States
30 h-index
93 publications
3.5K citations

Centre National de la Recherche Scientifique
Paris, France
30 h-index
89 publications
4.4K citations
Emory University
Atlanta, United States
30 h-index
75 publications
4.3K citations

Tel Aviv University
Tel Aviv, Israel
29 h-index
68 publications
3.1K citations
Rutgers, The State University of New Jersey
New Brunswick, United States
28 h-index
91 publications
5.5K citations

Alfréd Rényi Institute of Mathematics
Budapest, Hungary
26 h-index
64 publications
2.4K citations
Carnegie Mellon University
Pittsburgh, United States
23 h-index
67 publications
2.4K citations
1–8 of 1.5K
175 publications · 5.9K citations
35
h-index
86 publications · 4.4K citations
35
h-index
88 publications · 3.9K citations
34
h-index
109 publications · 3.8K citations
31
h-index
68 publications · 2.4K citations
29
h-index
1–5