A maximal matching in a graph is a set of edges such that no two edges share a vertex, and it is not possible to add any more edges to the set without violating this condition. A simple linear complexity algorithm to compute a maximal matching in a g...