Faster algorithm for finding maximum 1-restricted simple 2-matchings

DOI10.1007/S00453-023-01148-6MaRDI QIDQ6119828zbMATH OpenFDO

Authors Stepan Artamonov, Maxim Babenko

Publication date 25 March 2024

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00453-023-01148-6

zbMATH Keywords

blocking augmentationsmin-max formulapolynomial algorithmrestricted matchings

Mathematics Subject Classification ID

Graph theory (05Cxx) Algorithms in computer science (68Wxx)

Cites work

• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Faster algorithm for finding maximum 1-restricted simple 2-matchings
• Matching theory
• Maximum cardinality 1-restricted simple 2-matchings
• Maximum skew-symmetric flows and matchings
• Packing paths of length at least two
• The k‐piece packing problem

This page was built for publication: Faster algorithm for finding maximum 1-restricted simple 2-matchings

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