Some conclusions bipartite graph

Minimum Vertex Cover = largest number of matched

= Minimum coverage points to FIG side - the largest number of matched

No = the smallest side cover of FIG point - the maximum number of matches / 2

= Number of independent Set Points - the maximum number of matches

 

method:

Staining

France ranks

Anti-bonding method

 

Guess you like

Origin www.cnblogs.com/OIEREDSION/p/11272768.html