Login / Signup
A tight quasi-polynomial bound for Global Label Min-Cut.
Lars Jaffke
Paloma T. Lima
Tomás Masarík
Marcin Pilipczuk
Uéverton S. Souza
Published in:
CoRR (2022)
Keyphrases
</>
upper bound
lower bound
min cut
worst case
max flow min cut
graph cuts
information theoretic
graph partitioning
graphical models
multi label
feature selection
linear programming
natural images
energy minimization