DBScholar

Back to papers

Incrementalizing Graph Algorithms

Summary: Incrementalizes batch graph algorithms via a fixpoint model to derive A_delta with cost tied to graph changes and touched region. States correctness and boundedness; uses existing data structures with timestamps; applicable to graph-centric algorithms. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6139
Venue
SIGMOD
Year
2021
Pagerank
6.7004839e-05
Overall Rank
4,443 | 69.52%
DOI
10.1145/3448016.3452796

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{fan_sigmod21,
        title = {{Incrementalizing Graph Algorithms}},
        author = {Fan, Wenfei and Tian, Chao and Xu, Ruiqi and Yin, Qiang and Yu, Wenyuan and Zhou, Jingren},
        series = {{SIGMOD} '21},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3448016.3452796},
        url = {https://dl.acm.org/doi/10.1145/3448016.3452796},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers