Graph Summarization with Bounded Error
Summary: Two-part graph representation: a summary graph and a corrections set, enabling lossless or lossy compression with provable bounded error. First to apply MDL to graph summarization; MDL-based summaries with corrections enable compact, bounded-error reconstructions, validated on real data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 25 of 25 citing papers.
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 |
|---|---|---|---|---|
| 14 | Online Aggregation | 1997 | SIGMOD | 0.0010813443 |
| 57 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00065421423 |
| 324 | Gigascope: A Stream Database for Network Applications | 2003 | SIGMOD | 0.00027465124 |
| 360 | Histogram-Based Approximation of Set-Valued Query Answers | 1999 | VLDB | 0.00025768448 |
| 416 | Approximate Query Processing Using Wavelets | 2000 | VLDB | 0.00023773968 |
| 1,599 | Semantic Compression and Pattern Extraction with Fascicles | 1999 | VLDB | 0.00011203327 |
| 2,079 | The Generalized MDL Approach for Summarization | 2002 | VLDB | 9.5972684e-05 |
| 4,671 | Extracting large-scale knowledge bases from the web | 1999 | VLDB | 6.0023843e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,208 | Summarizing Answer Graphs Induced by Keyword Queries | 2013 | VLDB | 5.1511024e-05 |
| 435 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD | 0.00023268266 |
| 10,161 | Enabling Efficient Direct Update on Rule-Based Compressed Graph | 2026 | SIGMOD | 4.1905499e-05 |
| 4,713 | Mining Graph Patterns Efficiently via Randomized Summaries | 2009 | VLDB | 5.9694403e-05 |
| 6,983 | CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression | 2023 | SIGMOD | 4.8682622e-05 |
| 5,030 | Making Graphs Compact by Lossless Contraction | 2021 | SIGMOD | 5.7445683e-05 |
| 10,967 | Graph Summarization: Compactness Meets Efficiency | 2024 | SIGMOD | 4.1905499e-05 |
| 1,572 | Query Preserving Graph Compression | 2012 | SIGMOD | 0.00011296109 |
| 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 |