Fast algorithm to find 2-factor of minimum weight

DOI10.1007/S10559-016-9847-9MaRDI QIDQ334255zbMATH OpenOpenAlexFDO

Authors O. B. Matsiy, A. V. Morozov, 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

matchingassignment problembipartite graph2-factoraugmenting path

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2159162
• Approximation algorithms for solving the 2-peripatetic salesman problem on a complete graph with edge weights 1 and 2
• Finding 2-factors closer to TSP tours in cubic graphs
• Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
• scientific article; zbMATH DE number 2102640

Cites work

• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• A good algorithm for smallest spanning trees with a degree constraint
• Matching theory
• The symmetric travelling salesman problem. II: New low bounds

Cited in

(1)

• A recurrent algorithm to solve the weighted matching problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334255)