Perfect Bipartite Matching

Правка en2, от err0r, 2019-05-03 21:24:11

How can i find maximum perfect matching in bipartite graph? it can be a a sub-graph of main bipartite graph?(a subset of vertex from left side and a subset of vertex from right side and they are perfect match).
if we take a vertex, each vertex that shares a edge with the selected vertex must be present in the subset of vertex too.

Теги biparite matching

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский err0r 2019-05-03 21:30:53 98 Tiny change: 'raph? <br>it can' -> 'raph? <br><br>it can'
en2 Английский err0r 2019-05-03 21:24:11 230 Tiny change: 'subset of vertex to' -> 'subset of vertex to'
en1 Английский err0r 2019-05-03 21:18:25 134 Initial revision (published)