Graph Summarization
Graph Summarization is a graph analytics technique that belongs to the class of data reduction methods, specifically distinguished by its focus on generating a compact, lossy representation of a graph that preserves essential structural patterns, node relationships, and domain-specific properties for efficient storage, querying, and analysis.
135
Publications
7.2K
Citations
372
Authors
176
Institutions
Publications per year
2017–2026
54
135
Efficient aggregation for graph summarization
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Patel · 2008 · 440 citations
Mariano P. Consens, Alberto O. Mendelzon · 1990 · 346 citations · Full text
Graph summarization with bounded error
Saket Navlakha, Rajeev Rastogi, Nisheeth Shrivastava · 2008 · 346 citations
Qun Chen, Andrew Lim, Kian Win Ong · 2003 · 235 citations
1–5 of 135
372
9
h-index
8
h-index
6
h-index
4
h-index
4
h-index
1–5 of 372
176
Carnegie Mellon University
Pittsburgh, United States
8 h-index
19 publications
1.3K citations
University of Michigan
Ann Arbor, United States
6 h-index
14 publications
1.5K citations
University of California, Santa Barbara
Santa Barbara, United States
5 h-index
14 publications
524 citations
Institute for Scientific Interchange
Turin, Italy
5 h-index
6 publications
214 citations
Nanyang Technological University
Singapore, Singapore
5 h-index
7 publications
177 citations
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
10 publications
2.1K citations

Centre National de la Recherche Scientifique
Paris, France
5 h-index
14 publications
430 citations
IBM (United States)
Armonk, United States
4 h-index
5 publications
217 citations
1–8 of 176
PVLDB · 10 publications · 379 citations
10
h-index
TKDE · 7 publications · 266 citations
7
h-index
Repository · 2 publications · 25 citations
2
h-index
2 publications · 156 citations
2
h-index
Repository · 2 publications · 276 citations
2
h-index
1–5