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

DOI10.1080/09720529.2020.1833439zbMath1487.05212OpenAlexW3119420649MaRDI QIDQ5035028

Yoshihide Watanabe, Sennosuke Watanabe, Yuki Nishida

Publication date: 21 February 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2020.1833439

zbMATH Keywords

maximum matchingoptimal matchingaugmenting trail

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Factors and factorizations of graphs. Proof techniques in factor theory
• Good characterizations for some degree constrained subgraphs
• Matching theory
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Applications of Menger's graph theorem
• Algorithms for the Assignment and Transportation Problems
• TWO THEOREMS IN GRAPH THEORY
• Dual integrality in b-matching problems
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• The maximum 1-2 matching problem and two kinds of its variants
• Augmenting trail theorem for the maximum 1-2 matching problem
• The factorization of graphs. II
• On some techniques useful for solution of transportation network problems
• Combinatorial optimization. Theory and algorithms
• Partial parity \((g,f)\)-factors and subgraphs covering given vertex subsets

This page was built for publication: Maximum and optimal 1-2 matching problem of the different kind