Fully Dynamic Maximal Matching in $O(\log n)$ Update Time
TLDR
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.Abstract:
We present an algorithm for maintaining maximal matching in a graph under addition and deletion of edges. Our algorithm is randomized and it takes expected amortized $O(\log n)$ time for each edge update, where $n$ is the number of vertices in the graph. While there exists a trivial $O(n)$ time algorithm for each edge update, the previous best known result for this problem is due to Ivkovicź and Lloyd [Lecture Notes in Comput. Sci. 790, Springer-Verlag, London, 1994, pp. 99--111]. For a graph with $n$ vertices and $m$ edges, they gave an $O( {(n+ m)}^{0.7072})$ update time algorithm which is sublinear only for a sparse graph. For the related problem of maximum matching, Onak and Rubinfeld [Proceedings of STOC'10, Cambridge, MA, 2010, pp. 457--464] designed a randomized algorithm that achieves expected amortized $O(\log^2 n)$ time for each update for maintaining a $c$-approximate maximum matching for some unspecified large constant $c$. In contrast, we 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. This in turn also implies a 2-approximate vertex cover maintenance scheme that takes expected amortized $O(\log n )$ time per update.read more
Citations
More filters
Faster approximation algorithms for partially dynamic shortest path problems
TL;DR: In this paper, a partiell-dynamically-adaptive algorithm for solving the problem of starting-knoten is proposed, in which the number of Anderungs in a graph is a function of the dimension of the graph.
Proceedings ArticleDOI
Dynamic ((1+𝜖) ln 𝑛)-Approximation Algorithms for Minimum Set Cover and Dominating Set
Shay Solomon,Amitai Uzrad +1 more
TL;DR: The current best dynamic primal-dual MSC algorithm with update time O(f 2 ) for any constant ǫ > 0 was proposed by Bhattacharya et al. as discussed by the authors .
Dynamic $(1+\epsilon)$-Approximate Matching Size in Truly Sublinear Update Time
TL;DR: In this paper , a fully dynamic algorithm for maintaining the maximum matching of the graph with n vertices and m edges using $m^{0.5-Omega_{\epsilon}(1)}$ update time is presented.
Fully Dynamic Matching: $(2-\sqrt{2})$-Approximation in Polylog Update Time
TL;DR: In this article , the authors showed that for any fixed ε > 0, a (1/2+ ε)-approximation can be maintained in O(n log n) time in general graphs.
Journal ArticleDOI
Dynamic Clustering to Minimize the Sum of Radii
TL;DR: A data structure is presented that maintains a solution whose cost is within a constant factor of the cost of an optimal solution in metric spaces with bounded doubling dimension and whose worst-case update time is logarithmic in the parameters of the problem.
References
More filters
Journal ArticleDOI
College Admissions and the Stability of Marriage
David Gale,Lloyd S. Shapley +1 more
TL;DR: In this article, the authors studied the relationship between college admission and the stability of marriage in the United States, and found that college admission is correlated with the number of stable marriages.
Journal ArticleDOI
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
John E. Hopcroft,Richard M. Karp +1 more
TL;DR: This paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to $(m + n)\sqrt n $.
Journal ArticleDOI
Matching, euler tours and the chinese postman
Jack Edmonds,Ellis L. Johnson +1 more
TL;DR: The solution of the Chinese postman problem using matching theory is given and the convex hull of integer solutions is described as a linear programming polyhedron, used to show that a good algorithm gives an optimum solution.
Proceedings ArticleDOI
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
Silvio Micali,Vijay V. Vazirani +1 more
TL;DR: An 0(√|V|¿|E|) algorithm for finding a maximum matching in general graphs works in 'phases'.