Fully Dynamic Matching in Bipartite Graphs

  title={Fully Dynamic Matching in Bipartite Graphs},
  author={Aaron Bernstein and Clifford Stein},
We present two fully dynamic algorithms for maximum cardinality matching in bipartite graphs. Our main result is a deterministic algorithm that maintains a (3/2+ ) approximation in worst-case update time O(m −2.5), which is polynomially faster than all previous deterministic algorithms for any constant approximation, and faster than all previous algorithms (randomized included) that achieve a better-than-2 approximation. We also give stronger results for bipartite graphs whose arboricity is at… CONTINUE READING


Publications referenced by this paper.

Similar Papers

Loading similar papers…