Finding strongly popular \(b\)-matchings in bipartite graphs (Q5915825)
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: Finding strongly popular \(b\)-matchings in bipartite graphs |
scientific article; zbMATH DE number 6827247
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding strongly popular \(b\)-matchings in bipartite graphs |
scientific article; zbMATH DE number 6827247 |
Statements
Finding strongly popular \(b\)-matchings in bipartite graphs (English)
0 references
18 January 2018
0 references
graph algorithms
0 references
stable marriage
0 references
popular matching
0 references
\(b\)-matching
0 references
