Sign in

A tight quasi-polynomial bound for Global Label Min-Cut.

Lars JaffkePaloma T. LimaTomás MasaríkMarcin PilipczukUéverton S. Souza
Published in: SODA (2023)
Keyphrases
  • upper bound
  • lower bound
  • min cut
  • worst case
  • max flow min cut
  • graph cuts
  • information theoretic
  • computer vision
  • pairwise