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)
Incoming Non-self Citations Over Time
Authors
- 1. Wenfei Fan (Shenzhen University; University of Edinburgh)
- 2. Chao Tian (Alibaba)
- 3. Ruiqi Xu (University of Edinburgh)
- 4. Qiang Yin (Alibaba)
- 5. Wenyuan Yu (Alibaba)
- 6. Jingren Zhou (Alibaba)
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 211 | AliGraph: A Comprehensive Graph Neural Network Platform | 2019 | VLDB | 0.00024805216 |
| 442 | Differential dataflow | 2013 | CIDR | 0.00018201988 |
| 948 | Parallelizing Sequential Graph Computations | 2017 | SIGMOD | 0.00012908602 |
| 953 | Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation | 2012 | VLDB | 0.00012871412 |
| 1,318 | Incremental Graph Pattern Matching | 2011 | SIGMOD | 0.00011044781 |
| 2,851 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD | 7.9382307e-05 |
| 4,400 | AliCoCo: Alibaba E-commerce Cognitive Concept Net | 2020 | SIGMOD | 6.6122536e-05 |
| 5,926 | Incrementalization of Graph Partitioning Algorithms | 2020 | VLDB | 5.9415738e-05 |
| 6,312 | Automating Incremental and Asynchronous Evaluation for Recursive Aggregate Data Processing | 2020 | SIGMOD | 5.8149275e-05 |
| 12,216 | Catching Numeric Inconsistencies in Graphs | 2018 | SIGMOD | 4.9769913e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 758 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB |
| 2 | 9,904 | Auto-Approximation of Graph Computing | 2014 | VLDB |
| 3 | 1,964 | Fast Iterative Graph Computation with Block Updates | 2013 | VLDB |
| 4 | 11,349 | Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach | 2025 | VLDB |
| 5 | 5,684 | iTurboGraph: Scaling and Automating Incremental Graph Analytics | 2021 | SIGMOD |
| 6 | 2,288 | Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs | 2019 | SIGMOD |
| 7 | 5,926 | Incrementalization of Graph Partitioning Algorithms | 2020 | VLDB |
| 8 | 10,161 | Automating Incremental Graph Processing with Flexible Memoization | 2021 | VLDB |
| 9 | 1,318 | Incremental Graph Pattern Matching | 2011 | SIGMOD |
| 10 | 2,851 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD |