A useful application of algorithms that solve this problem is in finding which sport teams in a league are still in the running to make the playoffs. In the solution to that baseball elimination problem, a maximum cardinality bipartite matching is conducted between teams and games. One algorithm solves it by building a layered graph at each iteration using breadth-first search on a residual graph; that approach was developed by Dinic. Another method used to solve this problem only works for integer edge weights; in that algorithm, augmenting paths are constructed until no paths exist from source to sink with residual capacity. That method was developed by Ford and Fulkerson. For 10 points, name this problem equivalent to finding the min cut
A useful application of algorithms that solve this problem is in finding which sport teams in a league are still in the running to make the playoffs. In the solution to that baseball elimination problem, a maximum cardinality bipartite matching is conducted between teams and games. One algorithm solves it by building a layered graph at each iteration using breadth-first search on a residual graph; that approach was developed by Dinic. Another method used to solve this problem only works for integer edge weights; in that algorithm, augmenting paths are constructed until no paths exist from source to sink with residual capacity. That method was developed by Ford and Fulkerson. For 10 points, name this problem equivalent to finding the min cut, which involves calculating the maximum capacity of a network.