Doubly Balanced Connected Graph Partitioning
Work
Year: 2017
Type: preprint
Abstract: 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→{-1, +1} satisfying P(V)=∑j∊v p(j)=... more
Institution Columbia University
Cites: 17
Cited by: 5
Related to: 10
Citation percentile (by year/subfield): 86.52
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze