A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Deterministic Dynamic Matching in O(1) Update Time

2019
*
Algorithmica
*

We consider the problems of maintaining an approximate maximum matching and an approximate minimum vertex cover in a dynamic graph undergoing a sequence of edge insertions/deletions. Starting with the seminal work of Onak and Rubinfeld (in: Proceedings of the ACM symposium on theory of computing (STOC), 2010), this problem has received significant attention in recent years. Very recently, extending the framework of Baswana et al. (in: gave a randomized dynamic algorithm for this problem that

doi:10.1007/s00453-019-00630-4
fatcat:vqgsq4gghjablm43jzq75nlho4