Beating the Folklore Algorithm for Dynamic Matching

06/18/2021
by   Mohammad Roghani, et al.
0

The maximum matching problem in dynamic graphs subject to edge updates (insertions and deletions) has received much attention over the last few years; a multitude of approximation/time tradeoffs were obtained, improving upon the folklore algorithm, which maintains a maximal (and hence 2-approximate) matching in O(n) worst-case update time in n-node graphs. We present the first deterministic algorithm which outperforms the folklore algorithm in terms of both approximation ratio and worst-case update time. Specifically, we give a (2-Ω(1))-approximate algorithm with O(√(n)√(m))=O(n^3/4) worst-case update time in n-node, m-edge graphs. For sufficiently small constant ϵ>0, no deterministic (2+ϵ)-approximate algorithm with worst-case update time O(n^0.99) was known. Our second result is the first deterministic (2+ϵ)-approximate (weighted) matching algorithm with O_ϵ(1)· O(√(m)) = O_ϵ(1)· O(√(n)) worst-case update time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/24/2021

Deterministic Dynamic Matching In Worst-Case Update Time

We present deterministic algorithms for maintaining a (3/2 + ϵ) and (2 +...
research
11/17/2017

Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms

We present a simple randomized reduction from fully-dynamic integral mat...
research
08/19/2021

Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds

In their breakthrough ICALP'15 paper, Bernstein and Stein presented an a...
research
05/16/2018

Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest

This paper gives a new deterministic algorithm for the dynamic Minimum S...
research
07/13/2018

Maintaning maximal matching with lookahead

In this paper we study the problem of fully dynamic maximal matching wit...
research
02/26/2018

Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs

We consider the problem of dynamically maintaining (approximate) all-pai...
research
05/17/2020

Matching in Stochastically Evolving Graphs

This paper studies the maximum cardinality matching problem in stochasti...

Please sign up or login with your details

Forgot password? Click here to reset