# Balanced cut problem

Last edited: 2023-11-16

# Statement

Balanced cut problem

Given an undirected graph $G = (V,E)$ and an integer $b$. Output a cut $S, T \subset V$ such that $cut(S,T) \leq b$ or no if no such cut exists.

# Solutions

# Theory

# Related problems