Incrementalization of Graph Partitioning Algorithms
Summary: NP-complete and cost-unbounded tri-criteria incremental graph partitioning, even for constant updates. Proposes A_delta: partitioners that produce Delta O from Delta G alone, preserving balance and cut bounds for vertex-cut and edge-cut; validated on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Wenfei Fan
- 2. Muyang Liu
- 3. Chao Tian
- 4. Ruiqi Xu
- 5. Jingren Zhou
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,194 | Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks | 2022 | SIGMOD | 6.3640644e-05 |
| 5,266 | Incrementalizing Graph Algorithms | 2021 | SIGMOD | 5.5949839e-05 |
| 5,951 | Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints | 2021 | SIGMOD | 5.2547916e-05 |
| 7,003 | RAGraph: A Region-Aware Framework for Geo-Distributed Graph Processing | 2024 | VLDB | 4.8609956e-05 |
| 8,900 | CUTTANA: Scalable Graph Partitioning for Faster Distributed Graph Databases and Analytics | 2025 | VLDB | 4.4229886e-05 |
| 9,805 | Automating Incremental Graph Processing with Flexible Memoization | 2021 | VLDB | 4.2766788e-05 |
| 10,659 | Triparts: Scalable Streaming Graph Partitioning to Enhance Community Structure | 2025 | VLDB | 4.1905499e-05 |
| 10,869 | Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs | 2025 | VLDB | 4.1905499e-05 |
| 10,877 | A Single Machine System for Querying Big Graphs with PRAM | 2025 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 39 | Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud | 2012 | VLDB | 0.00075263552 |
| 441 | Parallelizing Sequential Graph Computations | 2017 | SIGMOD | 0.00023172424 |
| 2,596 | LEOPARD: Lightweight Edge-Oriented Partitioning and Replication for Dynamic Graphs | 2016 | VLDB | 8.4690558e-05 |
| 3,439 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD | 7.0916563e-05 |
| 3,577 | A Scalable Distributed Graph Partitioner | 2015 | VLDB | 6.9485009e-05 |
| 4,236 | Distributed Edge Partitioning for Trillion-edge Graphs | 2019 | VLDB | 6.3296839e-05 |
| 4,472 | LogGP: A Log-based Dynamic Graph Partitioning Method | 2014 | VLDB | 6.1486739e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,852 | Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs | 2019 | SIGMOD | 8.0158741e-05 |
| 11,702 | Dynamic Scaling for Parallel Graph Computations | 2019 | VLDB | 4.1905499e-05 |
| 3,646 | Real-Time Multi-Criteria Social Graph Partitioning: A Game Theoretic Approach | 2015 | SIGMOD | 6.880993e-05 |
| 4,236 | Distributed Edge Partitioning for Trillion-edge Graphs | 2019 | VLDB | 6.3296839e-05 |
| 1,806 | Incremental Graph Pattern Matching | 2011 | SIGMOD | 0.00010478244 |
| 5,951 | Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints | 2021 | SIGMOD | 5.2547916e-05 |
| 3,439 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD | 7.0916563e-05 |
| 4,499 | Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent | 2019 | VLDB | 6.132875e-05 |
| 4,868 | Application Driven Graph Partitioning | 2020 | SIGMOD | 5.8595544e-05 |
| 5,266 | Incrementalizing Graph Algorithms | 2021 | SIGMOD | 5.5949839e-05 |