|
Volumn 2996, Issue , 2004, Pages 222-233
|
Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
GRAPH THEORY;
ADJACENCY LISTS;
BIPARTITE GRAPHS;
MANY-TO-ONE;
MATCHINGS;
RUNNING TIME;
STABLE MARRIAGE PROBLEM;
STABLE MATCHING;
HOSPITALS;
|
EID: 35048879705
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/978-3-540-24749-4_20 Document Type: Article |
Times cited : (17)
|
References (9)
|