--
Chien-Chung Huang
(Gothenburg)
Abstract: We consider the problem of computing a large stable matching
in a bipartite graph G = (A\cup B, E) where each vertex u \in A\cup B
ranks its neighbors in an order of preference, perhaps involving ties.
A matching M is said to be stable if there is ...
