A faster algorithm for the Strongly Stable \(b\)-Matching Problem (Q2294060)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A faster algorithm for the Strongly Stable \(b\)-Matching Problem |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A faster algorithm for the Strongly Stable \(b\)-Matching Problem |
scientific article |
Statements
A faster algorithm for the Strongly Stable \(b\)-Matching Problem (English)
0 references
6 February 2020
0 references
stable marriage
0 references
strongly stable matching
0 references
\(b\)-matching
0 references