Finding a set of edges which do not share any vertex is called a matching in graph theory. This topic deals with finding maximum and minimum matching in a graph.
Finding a set of edges which do not share any vertex is called a matching in graph theory. This topic deals with finding maximum and minimum matching in a graph.