67 citations · 244 across the 17 of their papers we have counts for
1 paper · 2 filters
Jakub Kozik, Grzegorz Matecki
We present a new approach, called a lazy matching, to the problem of on-line matching on bipartite graphs. Imagine that one side of a graph is given and the vertices of the other s…