Find the minimum-size edge cover for g

An edge cover of an undirected graph G = (V,E) is a set of edges such that each vertex in the graph is incident to at least one edge from the set. Give an efficient algorithm, based on matching, to find the minimum-size edge cover for G.

Leave a Reply

Your email address will not be published. Required fields are marked *