Graph Coarsening
Graph Coarsening is a graph transformation technique that reduces the size of a graph by merging nodes and edges into super-nodes and super-edges while preserving the graph’s structural and semantic properties to facilitate efficient computation in graph-based learning tasks.
56
Publications
4.5K
Citations
160
Authors
88
Institutions
Publications per year
2017–2026
43
56
View-GCN: View-Based Graph Convolutional Network for 3D Shape Analysis
Xin Wei, Ruixuan Yu, Jian Sun · 2020 · 329 citations
Towards Sparse Hierarchical Graph Classifiers
Cătălina Cangea, Petar Veličković, Nikola Jovanović et al. · arXiv (Cornell University) · 2018 · 200 citations · Full text
1–5 of 56
160
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 160
88
Karlsruhe Institute of Technology
Karlsruhe, Germany
3 h-index
7 publications
229 citations

Cornell University
Ithaca, United States
3 h-index
7 publications
220 citations
University of Cambridge
Cambridge, United Kingdom
3 h-index
7 publications
127 citations
Tsinghua University
Beijing, China
3 h-index
7 publications
140 citations
Nanjing University of Science and Technology
Nanjing, China
2 h-index
2 publications
229 citations

University of Minnesota
Minneapolis, United States
2 h-index
5 publications
2.5K citations

Xi'an Jiaotong University
Xi'an, China
2 h-index
6 publications
1.1K citations
École nationale des ponts et chaussées
Champs-sur-Marne, France
2 h-index
3 publications
1.4K citations
1–8 of 88
Repository · 10 publications · 351 citations
10
h-index
TKDE · 2 publications · 49 citations
2
h-index
Conference · 2 publications · 110 citations
2
h-index
Repository · 1 publications · 50 citations
1
h-index
1 publications · 19 citations
1
h-index
1–5