Hypergraph Decompositions is a methodological framework in hypergraph theory that partitions a hypergraph into simpler, structured sub-hypergraphs according to specified combinatorial or algebraic criteria, enabling the analysis of complex relational systems through hierarchical or component-wise characterization.
244
Publications
11.1K
Citations
474
Authors
283
Institutions
Publications per year
2017–2026
56
Parents
Publications
244
Multilevel hypergraph partitioning
George Karypis, Rajat Aggarwal, Vipin Kumar et al. · 1997 · 718 citations · Full text
1–5 of 244
Authors
474
- GG
12
h-index
- AB
7
h-index
- DK
5
h-index
- CA
5
h-index
- DO
5
h-index
1–5 of 474
Institutions
283
TU Wien
Vienna, Austria
10 h-index
20 publications
538 citations
University of Oxford
Oxford, United Kingdom
8 h-index
10 publications
524 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
8 h-index
12 publications
387 citations
University of Waterloo
Waterloo, Canada
6 h-index
8 publications
661 citations
University of Calabria
Rende, Italy
6 h-index
14 publications
263 citations
University of Birmingham
Birmingham, United Kingdom
5 h-index
13 publications
336 citations
Centre National de la Recherche Scientifique
Paris, France
4 h-index
6 publications
145 citations
Hong Kong Polytechnic University
Hong Kong, Hong Kong
4 h-index
6 publications
307 citations
1–8 of 283
Venues
- Discrete Applied Mathematics
12 publications · 346 citations
11
h-index
- Discrete Mathematics
11 publications · 352 citations
10
h-index
- Journal of Combinatorial Theory Series B
9 publications · 659 citations
9
h-index
- Linear Algebra and its Applications
8 publications · 345 citations
8
h-index
- Journal of Combinatorial Theory Series A
7 publications · 163 citations
7
h-index
1–5