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 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 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 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 show a fully dynamic algorithm for maintaining (1+ ϵ)-approximate size of maximum
matching of the graph with n vertices and m edges using m0. 5− Ωϵ (1) update time. This is …

Given a graph G, an edge-coloring is an assignment of colors to edges of G such that any
two edges sharing an endpoint receive different colors. By Vizing's celebrated theorem, any …

Given a graph $ G $, an edge-coloring is an assignment of colors to edges of $ G $ such that
any two edges sharing an endpoint receive different colors. By Vizing's celebrated theorem …

In this paper we provide an algorithm for maintaining a (1− є)-approximate maximum flow in
a dynamic, capacitated graph undergoing edge insertions. Over a sequence of m insertions …

We study dynamic (1− є)-approximate rounding of fractional matchings—a key ingredient in
numerous breakthroughs in the dynamic graph algorithms literature. Our first contribution is …