The maximum 1-2 matching problem and two kinds of its variants

We present an algorithm for solving the maximum 1-2 matching problem in bipartite graphs by reducing it to solving the 1-1 matching in general undirected graphs. Further, we propose two variants of...

[1]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Yoshihide Watanabe,et al.  Augmenting trail theorem for the maximum 1-2 matching problem , 2017, Discret. Math. Algorithms Appl..