DBScholar

Back to papers

SparRL: Graph Sparsification via Deep Reinforcement Learning

Summary: SparRL: a general RL-based framework for graph sparsification, with size-independent cost and flexible reduction objectives. Empirical results show SparRL surpasses baselines on diverse objectives, underscoring broad applicability to graph representation tasks. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6459
Venue
SIGMOD
Year
2022
Pagerank
5.093636e-05
Overall Rank
11,553 | 20.74%
DOI
10.1145/3514221.3520254

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{wickman_sigmod22,
        title = {{SparRL: Graph Sparsification via Deep Reinforcement Learning}},
        author = {Wickman, Ryan},
        series = {{SIGMOD} '22},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3514221.3520254},
        url = {https://dl.acm.org/doi/10.1145/3514221.3520254},
        year = {2022}
}

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 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,163 Local Graph Sparsification for Scalable Clustering 2011 SIGMOD 0.00011865557
Previous Page 1 / 1 Next

Semantically Similar Papers