Yuri Boykov and Vladimir Kolmogorov elucidated a new algorithm for determining this condition, with application to energy minimization in computer-vision problems. An algorithm for finding this condition performs a push operation until there is no admissible arc, then does a relabel operation. Another algorithm for finding this condition maintains a scaling parameter and requires integer capacities for a good runtime. Dinic's algorithm determines this condition by finding paths that entirely consist of (*) saturated arcs. This condition is met when the residual network has no augmenting paths, a property exploited by the Ford-Fulkerson algorithm for finding this condition. For 10 points, nam
Yuri Boykov and Vladimir Kolmogorov elucidated a new algorithm for determining this condition, with application to energy minimization in computer-vision problems. An algorithm for finding this condition performs a push operation until there is no admissible arc, then does a relabel operation. Another algorithm for finding this condition maintains a scaling parameter and requires integer capacities for a good runtime. Dinic's algorithm determines this condition by finding paths that entirely consist of (*) saturated arcs. This condition is met when the residual network has no augmenting paths, a property exploited by the Ford-Fulkerson algorithm for finding this condition. For 10 points, name this condition that, according to a famous theorem, is equivalent to a min cut.
Yuri Boykov and Vladimir Kolmogorov elucidated a new algorithm for determining this condition, with application to energy minimization in computer-vision problems.
max flow [or: maximum flow; until it is read, accept: min cut, minimum cut]