Doubly Balanced Connected Graph Partitioning

Saleh Soltan, Mihalis Yannakakis, Gil Zussman

We introduce and study the Doubly Balanced Connected graph Partitioning (DBCP) problem: Let $G=(V,E)$ be a connected graph with a weight (supply/demand) function $p:V\rightarrow \{…