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
- 1. Saket Navlakha (AT&T; University of Maryland)
- 2. Rajeev Rastogi (AT&T; Yahoo)
- 3. Nisheeth Shrivastava (AT&T)
BibTeX Citation
@inproceedings{navlakha_sigmod08,
title = {{Graph Summarization with Bounded Error}},
author = {Navlakha, Saket and Rastogi, Rajeev and Shrivastava, Nisheeth},
series = {{SIGMOD} '08},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/1376616.1376661},
url = {https://dl.acm.org/doi/10.1145/1376616.1376661},
year = {2008}
}
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 |
|---|---|---|---|---|
| 9 | Online Aggregation | 1997 | SIGMOD | 0.00076265429 |
| 131 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00030236369 |
| 240 | Gigascope: A Stream Database for Network Applications | 2003 | SIGMOD | 0.00023425462 |
| 309 | Approximate Query Processing Using Wavelets | 2000 | VLDB | 0.00021376597 |
| 448 | Histogram-Based Approximation of Set-Valued Query Answers | 1999 | VLDB | 0.00018121533 |
| 1,758 | Semantic Compression and Pattern Extraction with Fascicles | 1999 | VLDB | 9.7095435e-05 |
| 2,435 | The Generalized MDL Approach for Summarization | 2002 | VLDB | 8.4706335e-05 |
| 6,106 | Extracting large-scale knowledge bases from the web | 1999 | VLDB | 5.8836299e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,924 | Summarizing Answer Graphs Induced by Keyword Queries | 2013 | VLDB |
| 2 | 498 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD |
| 3 | 10,649 | Enabling Efficient Direct Update on Rule-Based Compressed Graph | 2026 | SIGMOD |
| 4 | 4,650 | Mining Graph Patterns Efficiently via Randomized Summaries | 2009 | VLDB |
| 5 | 6,529 | CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression | 2023 | SIGMOD |
| 6 | 5,556 | Making Graphs Compact by Lossless Contraction | 2021 | SIGMOD |
| 7 | 11,529 | Graph Summarization: Compactness Meets Efficiency | 2024 | SIGMOD |
| 8 | 1,375 | Query Preserving Graph Compression | 2012 | SIGMOD |
| 9 | 6,391 | Utility-Driven Graph Summarization | 2019 | VLDB |
| 10 | 5,079 | Efficient Graph Summarization using Weighted LSH at Billion-Scale | 2021 | SIGMOD |