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

DOI10.1007/978-3-031-06678-8_7OpenAlexW4285243628MaRDI QIDQ2169943

Stepan Artamonov, Maxim A. Babenko

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-06678-8_7

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

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

Cites Work

• Maximum cardinality 1-restricted simple 2-matchings
• Matching theory
• Maximum skew-symmetric flows and matchings
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

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