We show a fully dynamic algorithm for maintaining (1+ϵ)-approximate size of maximum
matching of the graph with n vertices and m edges using m^0.5-ϵ(1) update time. This is the …

We present dynamic algorithms with polylogarithmic update time for estimating the size of
the maximum matching of a graph undergoing edge insertions and deletions with …

We study fully dynamic algorithms for maximum matching. This is a well-studied problem,
known to admit several update-time/approximation trade-offs. For instance, it is known how …

We study maximum matchings in fully dynamic graphs, which are graphs that undergo both
edge insertions and deletions. Our focus is on algorithms that estimate the size of maximum …

We prove that any semi-streaming algorithm for (1+ε) approximation of maximum bipartite
matching requires Ω\left (\log (1/ε)\log (1/β)\right) passes, where β∈(0,1) is the largest …

We present a simple semi-streaming algorithm for (1—ɛ)-approximation of bipartite
matching in O (log (n)/ɛ) passes. This matches the performance of state-of-the-art “ɛ …

Recent Advances in Multi-Pass Graph Streaming Lower Bounds Page 1 Recent Advances in
Multi-Pass Graph Streaming Lower Bounds Sepehr Assadi Cheriton School of Computer …

We study connections between the problem of fully dynamic (1-ϵ)-approximate maximum
bipartite matching, and the dual (1+ϵ)-approximate vertex cover problem, with the online …

We study the fully dynamic maximum matching problem. In this problem, the goal is to
efficiently maintain an approximate maximum matching of a graph that is subject to edge …

In this paper, we give the first unconditional space lower bound for two-pass streaming
algorithms for Maximum Bipartite Matching approximation. We show that every randomized …