gXa's blog

Maximum Bipartite Matching
By gXa, history, 10 years ago, In English

Please tell the complexity of http://www.geeksforgeeks.org/maximum-bipartite-matching/ ?

And if we use directly Ford-Fulkerson Algorithm, will it be better?

  • Vote: I like it
  • +4
  • Vote: I do not like it

»
10 years ago, hide # |
 
Vote: I like it +8 Vote: I do not like it

Maximum Bipartite Matching with Ford-Fulkerson takes O(VE) time. Using Dinic instead of Ford-Fulkerson (or Edmonds Karp for that matter; note that Edmonds Karp always find the shortest augmenting path instead of finding a random path), you can achieve a complexity of .

→ Reply
  • »
    »
    10 years ago, hide # ^ |
    ← Rev. 2  
    Vote: I like it +3 Vote: I do not like it

    Can you plz explain the complexity of the link I provided?

    Secondly when and how Ford-Fulkerson Algorithm becomes better?

    → Reply
    • »
      »
      »
      10 years ago, hide # ^ |
       
      Vote: I like it +5 Vote: I do not like it

      In the link, the bipartite matching is done using Ford-Fulkerson, so the complexity is O(VE).

      I don't understand your second question.

      A very good source to learn Max-Flow is CLRS. There's an entire chapter dedicated to network flows. You should read it.

      → Reply