Augmenting trail theorem for the maximum 1-2 matching problem

DOI10.1142/S1793830917500562zbMath1420.05147OpenAlexW2734465089MaRDI QIDQ5370831

Yoshihide Watanabe, Sennosuke Watanabe, Hiroki Izumi

Publication date: 20 October 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830917500562

zbMATH Keywords

bipartite graphmatchingaugmenting path theorem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Maximum and optimal 1-2 matching problem of the different kind ⋮ The maximum 1-2 matching problem and two kinds of its variants

Cites Work

• Unnamed Item
• TWO THEOREMS IN GRAPH THEORY
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Augmenting trail theorem for the maximum 1-2 matching problem