A faster algorithm for the Strongly Stable \(b\)-Matching Problem

DOI10.1007/978-3-030-17402-6_25OpenAlexW2946179162MaRDI QIDQ2294060

Adam Kunysz

Publication date: 6 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17402-6_25

zbMATH Keywords

\(b\)-matchingstable marriagestrongly stable matching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Characterization of super-stable matchings

This page was built for publication: A faster algorithm for the Strongly Stable \(b\)-Matching Problem