[CITATION][C] Graph partitioning: Formulations and applications to big data
Given an input graph G=(V, E) and an integer k≥ 2, the graph partitioning problem is to
divide V into k disjoint blocks of vertices V 1, V 2,…, V k, such that∪ 1≤ i≤ k V i= V, while
simultaneously optimizing an objective function and maintaining balance:\(| V_i|\leq
(1+\epsilon)\left\lceil| V|/k\right\rceil\)
divide V into k disjoint blocks of vertices V 1, V 2,…, V k, such that∪ 1≤ i≤ k V i= V, while
simultaneously optimizing an objective function and maintaining balance:\(| V_i|\leq
(1+\epsilon)\left\lceil| V|/k\right\rceil\)