A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond

Cited by: 7|Bibtex|Views18|Links

Abstract:

We consider the classical Minimum Balanced Cut problem: given a graph $G$, compute a partition of its vertices into two subsets of roughly equal volume, while minimizing the number of edges connecting the subsets. We present the first deterministic, almost-linear time approximation algorithm for this problem. Our algorithm in fact provi...More

Code:

Data:

Your rating :
0

 

Tags
Comments