New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS

  title={New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS},
  author={Soheil Behnezhad and Sanjeev Khanna},
We study the maximum matching problem in fully dynamic graphs: a graph is undergoing both edge insertions and deletions, and the goal is to efficiently maintain a large matching after each edge update. This problem has received considerable attention in recent years. The known algorithms naturally exhibit a trade-off between the quality of the matching maintained (i.e., the approximation ratio) and the time needed per update. While several interesting results have been obtained, the optimal… 
1 Citations

Tables from this paper

Deterministic $(1+\varepsilon)$-Approximate Maximum Matching with $\mathsf{poly}(1/\varepsilon)$ Passes in the Semi-Streaming Model and Beyond
We present a deterministic (1 + ε ) -approximate maximum matching algorithm in poly 1 /ε passes in the semi-streaming model, solving the long-standing open problem of breaking the exponential barrier


Faster Fully Dynamic Matchings with Small Approximation Ratios
A fully dynamic deterministic algorithm that maintains a (3/2 + e)-approximation in amortized update time O(m1/4e--2.5) and manages to be polynomially faster than all existing deterministic algorithms, while still maintaining a better-than-2 approximation.
Fully Dynamic (1+ e)-Approximate Matchings
The main result is a data structure that maintains a (1+ϵ) approximation of maximum matching under edge insertions/deletions in worst case Õ(√mϵ-2) time per update, which improves the 3/2 approximation given by Neiman and Solomon [20] which runs in similar time.
Simple deterministic algorithms for fully dynamic maximal matching
This paper shows the first deterministic fully dynamic algorithm that outperforms the trivial one and provides a deterministic worst-case update time of O(√m), which maintains a matching which is in fact a 3/2-approximate maximum cardinality matching (MCM).
Fully Dynamic Maximal Matching in Constant Update Time
  • Shay Solomon
  • Computer Science
    2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2016
The question in the affirmative is resolved, by presenting a randomized algorithm for maintaining maximal matching in general graphs with constant amortized update time and the optimal runtime bound O(t) of the algorithm holds both in expectation and with high probability.
Improved Analysis of EDCS via Gallai-Edmonds Decomposition
This note revisits the edge-degree constrained subgraph (EDCS) and presents an improved bound for its key property in general graphs and a new proof of the approximation guarantee of EDCS that builds on the graph's Gallai-Edmonds decomposition, avoiding the probabilistic method of the previous proofs.
Fully Dynamic Maximal Matching in O (log n) Update Time
This is the first polylog update time for maximal matching that implies an exponential improvement from the previous results and can maintain a factor two approximate maximum matching in $O(\log n )$ expected amortized time per update as a direct corollary of the maximal matching scheme.
Beating the Folklore Algorithm for Dynamic Matching
This work presents the first deterministic algorithm which outperforms the folklore algorithm in terms of both approximation ratio and worst-case update time, and shows how to use dynamic bipartite matching algorithms as black-box subroutines for dynamic matching in general graphs without incurring the natural 2 factor in the approximation ratio which such approaches naturally incur.
Fully Dynamic Maximal Matching in O(log n) Update Time
An algorithm for maintaining maximal matching in a graph under addition and deletion of edges that can maintain a factor 2 approximate maximum matching in expected amortized $O(\log n )$ time per update as a direct corollary of the maximal matching scheme.
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time
The first algorithm for maintaining a maximal independent set (MIS) of a fully dynamic graph---which undergoes both edge insertions and deletions---in polylogarithmic time is presented and a simpler variant of the algorithm can be used to maintain a random-order lexicographically first maximal matching in the same update-time.
Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier
A randomized algorithm for maintaining an almost-maximal matching in fully dynamic graphs with polylogarithmic worst-case update time is presented, derived from a deterministic algorithm in this offline model, and holds deterministically and with high probability.