An extendable stable matching algorithm of a kind of bipartite graph (Q5069846)
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: An extendable stable matching algorithm of a kind of bipartite graph |
scientific article; zbMATH DE number 7509173
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An extendable stable matching algorithm of a kind of bipartite graph |
scientific article; zbMATH DE number 7509173 |
Statements
An extendable stable matching algorithm of a kind of bipartite graph (English)
0 references
19 April 2022
0 references
college admission problem
0 references
extensive matching
0 references
stable extensive matching
0 references
stable alternated path
0 references
0 references
0.91345775
0 references
0.9091375
0 references
0 references
0.9030052
0 references
0.8981418
0 references
0.89531076
0 references
0.8952104
0 references
0.89204746
0 references
