Augmenting trail theorem for the maximum 1-2 matching problem
2017 ◽
Vol 09
(04)
◽
pp. 1750056
◽
Keyword(s):
We consider the maximum 1-2 matching problem in bipartite graphs. The notion of the augmenting trail for the 1-2 matching problem, which is the extension of the notion of the augmenting path for the 1-1 matching problem is introduced. The main purpose of the present paper is to prove “the augmenting trail theorem” for the 1-2 matching problem in the bipartite graph, which is an analogue of the augmenting path theorem by Bergé for the usual 1-1 matching problems.
2020 ◽
Keyword(s):
2020 ◽
Keyword(s):
Keyword(s):
2009 ◽
Vol 109
(12)
◽
pp. 608-610
◽
2009 ◽
pp. 607-615
2013 ◽
Vol 22
(5)
◽
pp. 783-799
◽
Keyword(s):