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

DOI10.1142/S1793830919500502zbMath1431.90131OpenAlexW2966673134MaRDI QIDQ5242821

Hiroki Izumi, Yoshihide Watanabe, Yuki Nishida, Sennosuke Watanabe

Publication date: 7 November 2019

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

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

zbMATH Keywords

bipartite graphmatchingaugmenting path theorem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Maximum and optimal 1-2 matching problem of the different kind

Cites Work

• Unnamed Item
• Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
• TWO THEOREMS IN GRAPH THEORY
• Paths, Trees, and Flowers
• Augmenting trail theorem for the maximum 1-2 matching problem
• Combinatorial optimization. Theory and algorithms

This page was built for publication: The maximum 1-2 matching problem and two kinds of its variants