A

Admin • 833K Points
Coach

Q. In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?

  • (A) bipartite matching
  • (B) cardinality matching
  • (C) augmenting
  • (D) weight matching

Explanation by: Admin

a simple path from a free vertex in v to a free vertex in u whose edges alternate between edges not in m and edges in m is called a augmenting path.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.