In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?
|Answer» C. augmenting|
|Explanation: 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.|
Login to Continue
It will take less than 2 minutes