Graph Summarization: Compactness Meets Efficiency
Summary: Graph summarization with exact reconstruction, targeting the long-standing compactness/efficiency tradeoff. Mags accelerates the greedy, most-compact paradigm with novel design; Mags-DM uses a different practical paradigm, both parallelizable and near-best in compactness at billion-scale. (summarized by gpt-5.4-mini on May 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Deming Chu
- 2. Fan Zhang
- 3. Wenjie Zhang
- 4. Ying Zhang
- 5. Xuemin Lin
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,526 | Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks | 2024 | VLDB | 4.4893996e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 327 | The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing | 2018 | VLDB | 0.00027312381 |
| 387 | Graph Summarization with Bounded Error | 2008 | SIGMOD | 0.00024682268 |
| 395 | One Trillion Edges: Graph Processing at Facebook-Scale | 2015 | VLDB | 0.00024440144 |
| 435 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD | 0.00023268266 |
| 2,609 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD | 8.4587236e-05 |
| 4,758 | Efficient Graph Summarization using Weighted LSH at Billion-Scale | 2021 | SIGMOD | 5.9347454e-05 |
| 5,030 | Making Graphs Compact by Lossless Contraction | 2021 | SIGMOD | 5.7445683e-05 |
| 11,008 | Influence Maximization via Vertex Countering | 2024 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,030 | Making Graphs Compact by Lossless Contraction | 2021 | SIGMOD | 5.7445683e-05 |
| 4,713 | Mining Graph Patterns Efficiently via Randomized Summaries | 2009 | VLDB | 5.9694403e-05 |
| 2,609 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD | 8.4587236e-05 |
| 6,208 | Summarizing Answer Graphs Induced by Keyword Queries | 2013 | VLDB | 5.1511024e-05 |
| 6,983 | CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression | 2023 | SIGMOD | 4.8682622e-05 |
| 5,975 | Summarizing Static and Dynamic Big Graphs | 2017 | VLDB | 5.2452824e-05 |
| 435 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD | 0.00023268266 |
| 387 | Graph Summarization with Bounded Error | 2008 | SIGMOD | 0.00024682268 |
| 6,330 | Utility-Driven Graph Summarization | 2019 | VLDB | 5.1028624e-05 |
| 4,758 | Efficient Graph Summarization using Weighted LSH at Billion-Scale | 2021 | SIGMOD | 5.9347454e-05 |