21 citations · 75 across the 20 of their papers we have counts for
1 paper · 2 filters
F. Brandl, T. Kavitha
Our input is a bipartite graph G=(A∪B,E) where each vertex in A∪B has a preference list strictly ranking its neighbors. The vertices in A and in B are called st…