Decremental Matching in General Graphs

07/03/2022
by   Sepehr Assadi, et al.
0

We consider the problem of maintaining an approximate maximum integral matching in a dynamic graph G, while the adversary makes changes to the edges of the graph. The goal is to maintain a (1+ϵ)-approximate maximum matching for constant ϵ>0, while minimizing the update time. In the fully dynamic setting, where both edge insertion and deletions are allowed, Gupta and Peng (see <cit.>) gave an algorithm for this problem with an update time of O(√(m)/ϵ^2). Motivated by the fact that the O_ϵ(√(m)) barrier is hard to overcome (see Henzinger, Krinninger, Nanongkai, and Saranurak [HKNS15]); Kopelowitz, Pettie, and Porat [KPP16]), we study this problem in the decremental model, where the adversary is only allowed to delete edges. Recently, Bernstein, Probst-Gutenberg, and Saranurak (see [BPT20]) gave an O_ϵ(1) update time decremental algorithm for this problem in bipartite graphs. However, beating O(√(m)) update time remained an open problem for general graphs. In this paper, we bridge the gap between bipartite and general graphs, by giving an O_ϵ(1) update time algorithm that maintains a (1+ϵ)-approximate maximum integral matching under adversarial deletions. Our algorithm is randomized, but works against an adaptive adversary. Together with the work of Grandoni, Leonardi, Sankowski, Schwiegelshohn, and Solomon [GLSSS19] who give an O_ϵ(1) update time algorithm for general graphs in the incremental (insertion-only) model, our result essentially completes the picture for partially dynamic matching.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/05/2019

Fully Dynamic Matching: Beating 2-Approximation in Δ^ε Update Time

In fully dynamic graphs, we know how to maintain a 2-approximation of ma...
research
07/15/2022

Dynamic Algorithms for Maximum Matching Size

We study fully dynamic algorithms for maximum matching. This is a well-s...
research
10/02/2018

Fully dynamic 3/2 approximate maximum cardinality matching in O(√(n)) update time

We present a randomized algorithm to maintain a maximal matching without...
research
07/25/2023

Fully Dynamic Consistent k-Center Clustering

We study the consistent k-center clustering problem. In this problem, th...
research
09/03/2020

Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs

We present an Õ(m+n^1.5)-time randomized algorithm for maximum cardinali...
research
09/04/2021

Dynamic Meta-theorems for Distance and Matching

Reachability, distance, and matching are some of the most fundamental gr...
research
11/17/2022

Incremental Approximate Maximum Flow in m^1/2+o(1) update time

We show an (1+ϵ)-approximation algorithm for maintaining maximum s-t flo...

Please sign up or login with your details

Forgot password? Click here to reset