DeepAI AI Chat
Log In Sign Up

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

by   Manas Jyoti Kashyop, et al.

We present a randomized algorithm to maintain a maximal matching without 3 length augmenting paths in the fully dynamic setting. Consequently, we maintain a 3/2 approximate maximum cardinality matching. Our algorithm takes expected amortized O(√(n)) time where n is the number of vertices in the graph when the update sequence is generated by an oblivious adversary. Over any sequence of t edge insertions and deletions presented by an oblivious adversary, the total update time of our algorithm is O(t√(n)) in expectation and O(t√(n) + n n) with high probability. To the best of our knowledge, our algorithm is the first one to maintain an approximate matching in which all augmenting paths are of length at least 5 in o(√(m)) update time.


page 1

page 2

page 3

page 4


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

In fully dynamic graphs, we know how to maintain a 2-approximation of ma...

Decremental Matching in General Graphs

We consider the problem of maintaining an approximate maximum integral m...

Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time

We present the first algorithm for maintaining a maximal independent set...

Incremental (1-ε)-approximate dynamic matching in O(poly(1/ε)) update time

In the dynamic approximate maximum bipartite matching problem we are giv...

Near-Optimal Fully Dynamic Densest Subgraph

We give the first fully dynamic algorithm which maintains a (1+ϵ)-approx...

A Proof of the MV Matching Algorithm

The Micali-Vazirani (MV) algorithm for maximum cardinality matching in g...

Distributed Maximum Matching Verification in CONGEST

We study the maximum cardinality matching problem in a standard distribu...