Let G be a un-weighted bipartite graph and

M = Maximum Cardinality Matching of G is given.

How to find the vertex cover of G in time linear in terms of edges of G?

Similar questions and discussions