Fast algorithm to find 2-factor of minimum weight

DOI10.1007/S10559-016-9847-9zbMath1348.05108OpenAlexW2398434887MaRDI QIDQ334255

A. V. Morozov, O. B. Matsiy, A. V. Panishev

Publication date: 1 November 2016

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-016-9847-9

zbMATH Keywords

bipartite graphmatching2-factorassignment problemaugmenting path

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A recurrent algorithm to solve the weighted matching problem

Cites Work

• Unnamed Item
• Unnamed Item
• Matching theory
• The symmetric travelling salesman problem. II: New low bounds
• A good algorithm for smallest spanning trees with a degree constraint

This page was built for publication: Fast algorithm to find 2-factor of minimum weight