Determination of a maximal matching in arbitrary graphs

Summary

There are two advantages of the algorithm given in the paper: (I) It applies to bipartite as well as to nonbipartite graphs and (II) it is easy to implement it on a computer. A computer program based on the algorithm has been tested using various graphs.