Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

Perfect Bipartite Matching

Revision en1, by err0r, 2019-05-03 21:18:25

How can i find maximum perfect matching in bipartite graph? it can be a a sub-graph of main bipartite graph?

Tags biparite matching

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English err0r 2019-05-03 21:30:53 98 Tiny change: 'raph? <br>it can' -> 'raph? <br><br>it can'
en2 English err0r 2019-05-03 21:24:11 230 Tiny change: 'subset of vertex to' -> 'subset of vertex to'
en1 English err0r 2019-05-03 21:18:25 134 Initial revision (published)