Incrementalization of graph partitioning algorithms

This paper studies incremental graph partitioning. Given a (vertex-cut or edge-cut) partition C(G) of a graph G and updates G to G, it is to compute changes O to C(G), yielding a partition of the u...