Minimum Cut in O(m log² n) Time.

Pawel Gawrychowski Shay Mozes Oren Weimann

Published in: ICALP (2020)

Keyphrases

minimum cut
maximum flow
graph cuts
weighted graph
shortest path
shortest path problem
graph partitioning
worst case
min cut
lower bound
min cut max flow
push relabel
energy minimization
normalized cut
directed graph
optimization problems
markov random field