Simple deterministic algorithms for fully dynamic maximal matching

Ofer Neiman, Shay Solomon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

71 Scopus citations

Abstract

A maximal matching can be maintained in fully dynamic (supporting both addition and deletion of edges) n-vertex graphs using a trivial deterministic algorithm with a worstcase update time of On). No deterministic algorithm that outperforms the näive O(n) one was reported up to this date. The only progress in this direction is due to Ivkovíc and Lloyd [14], who in 1993 devised a deterministic algorithm with an amortized update time of O((n+m) √ 2/2), where m is the number of edges. In this paper we show the first deterministic fully dynamic algorithm that outperforms the trivial one. Specifically, we provide a deterministic worst-case update time of O( √ m). Moreover, our algorithm maintains a matching which is in fact a 3/2-approximate maximum cardinality matching (MCM). We remark that no fully dynamic algorithm for maintaining (2-ε)-approximate MCM improving upon the näive O(n) was known prior to this work, even allowing amortized time bounds and randomization. For low arboricity graphs (e.g., planar graphs and graphs excluding fixed minors), we devise another simple deterministic algorithm with sub-logarithmic update time. Specifically, it maintains a fully dynamic maximal matching with amortized update time of O(log n/ log log n). This result addresses an open question of Onak and Rubinfeld [19]. We also show a deterministic algorithm with optimal space usage of O(n + m), that for arbitrary graphs maintains a maximal matching with amortized update time of O( √ m).

Original languageEnglish
Title of host publicationSTOC 2013 - Proceedings of the 2013 ACM Symposium on Theory of Computing
Pages745-753
Number of pages9
DOIs
StatePublished - 2013
Externally publishedYes
Event45th Annual ACM Symposium on Theory of Computing, STOC 2013 - Palo Alto, CA, United States
Duration: 1 Jun 20134 Jun 2013

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference45th Annual ACM Symposium on Theory of Computing, STOC 2013
Country/TerritoryUnited States
CityPalo Alto, CA
Period1/06/134/06/13

Keywords

  • Dynamic algorithms
  • Maximal matching
  • Maximum matching

Fingerprint

Dive into the research topics of 'Simple deterministic algorithms for fully dynamic maximal matching'. Together they form a unique fingerprint.

Cite this