Week 10 - Computational Complexity

Max Biparte Matching via Max-Flow

  • Input: A bipartite graph G = (V, E)

  • Find Max Bitartite Matching in G