Poligras: Policy-based Graph Summarization
Summary: Poligras uses a learned probabilistic policy (neural networks) to model and optimize the core supernode-pair selection/merging step in graph summarization. First scalable, learning-enhanced method producing lossless supergraph+correction summaries with much better quality/runtime than prior SOTA on large real graphs. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Jiyang Bai (Florida State University)
- 2. Peixiang Zhao (Florida State University)
BibTeX Citation
@article{bai_vldb24,
title = {{Poligras: Policy-based Graph Summarization}},
author = {Bai, Jiyang and Zhao, Peixiang},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {10},
pages = {2432--2444},
doi = {10.14778/3675034.3675037},
url = {https://doi.org/10.14778/3675034.3675037},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 486 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD | 0.00017692185 |
| 548 | Graph Summarization with Bounded Error | 2008 | SIGMOD | 0.00016694936 |
| 746 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD | 0.00014402233 |
| 1,336 | Query Preserving Graph Compression | 2012 | SIGMOD | 0.00011118804 |
| 2,148 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD | 9.0825156e-05 |
| 3,160 | Graph Cube: On Warehousing and OLAP Multidimensional Networks | 2011 | SIGMOD | 7.6823631e-05 |
| 4,953 | Efficient Graph Summarization using Weighted LSH at Billion-Scale | 2021 | SIGMOD | 6.4303691e-05 |
| 5,415 | Making Graphs Compact by Lossless Contraction | 2021 | SIGMOD | 6.2255551e-05 |
| 5,751 | Summarizing Static and Dynamic Big Graphs | 2017 | VLDB | 6.0994565e-05 |
| 6,266 | Utility-Driven Graph Summarization | 2019 | VLDB | 5.9355329e-05 |
| 6,876 | A Hierarchical Contraction Scheme for Querying Big Graphs | 2022 | SIGMOD | 5.7483615e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,913 | Inference-friendly Graph Compression for Graph Neural Networks | 2025 | VLDB |
| 2 | 3,788 | Graph-Based Synopses for Relational Selectivity Estimation | 2006 | SIGMOD |
| 3 | 5,849 | Summarizing Answer Graphs Induced by Keyword Queries | 2013 | VLDB |
| 4 | 2,148 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD |
| 5 | 13,467 | The Power of Summarization in Graph Mining and Learning: Smaller Data, Faster Methods, More Interpretability | 2021 | VLDB |
| 6 | 4,953 | Efficient Graph Summarization using Weighted LSH at Billion-Scale | 2021 | SIGMOD |
| 7 | 11,178 | Graph Summarization: Compactness Meets Efficiency | 2024 | SIGMOD |
| 8 | 5,751 | Summarizing Static and Dynamic Big Graphs | 2017 | VLDB |
| 9 | 486 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD |
| 10 | 6,266 | Utility-Driven Graph Summarization | 2019 | VLDB |