26 citations · 63 across the 12 of their papers we have counts for
1 paper · 1 filter
Aaron Bernstein, Cliff Stein
Maximum cardinality matching in bipartite graphs is an important and well-studied problem. The fully dynamic version, in which edges are inserted and deleted over time has also bee…