DBScholar

Back to papers

Incrementalization of Graph Partitioning Algorithms

Summary: Formalizes incremental graph partitioning, proving tri-criteria optimization NP-complete even for constant updates and unbounded under update-local costs. Derives vertex-/edge-cut incrementalizers preserving balance and cut guarantees, with repartitioning determined solely by ΔG. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
12229
Venue
VLDB
Year
2020
Pagerank
6.0782651e-05
Overall Rank
5,811 | 60.14%
DOI
10.14778/3389133.3389142

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{fan_vldb20,
        title = {{Incrementalization of Graph Partitioning Algorithms}},
        author = {Fan, Wenfei and Liu, Muyang and Tian, Chao and Xu, Ruiqi and Zhou, Jingren},
        journal = {PVLDB},
        series = {{VLDB} '20},
        volume = {13},
        number = {8},
        pages = {1261--1274},
        doi = {10.14778/3389133.3389142},
        url = {https://doi.org/10.14778/3389133.3389142},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers