Hegerfeld, Falko ;
Kratsch, Stefan
On Adaptive Algorithms for Maximum Matching
Abstract
In the fundamental Maximum Matching problem the task is to find a maximum cardinality set of pairwise disjoint edges in a given undirected graph. The fastest algorithm for this problem, due to Micali and Vazirani, runs in time O(sqrt{n}m) and stands unbeaten since 1980. It is complemented by faster, often lineartime, algorithms for various special graph classes. Moreover, there are fast parameterized algorithms, e.g., time O(km log n) relative to treewidth k, which outperform O(sqrt{n}m) when the parameter is sufficiently small.
We show that the MicaliVazirani algorithm, and in fact any algorithm following the phase framework of Hopcroft and Karp, is adaptive to beneficial input structure. We exhibit several graph classes for which such algorithms run in linear time O(n+m). More strongly, we show that they run in time O(sqrt{k}m) for graphs that are k vertex deletions away from any of several such classes, without explicitly computing an optimal or approximate deletion set; before, most such bounds were at least Omega(km). Thus, any phasebased matching algorithm with lineartime phases obliviously interpolates between linear time for k=O(1) and the worst case of O(sqrt{n}m) when k=Theta(n). We complement our findings by proving that the phase framework by itself still allows Omega(sqrt{n}) phases, and hence time Omega(sqrt{n}m), even on paths, cographs, and bipartite chain graphs.
BibTeX  Entry
@InProceedings{hegerfeld_et_al:LIPIcs:2019:10647,
author = {Falko Hegerfeld and Stefan Kratsch},
title = {{On Adaptive Algorithms for Maximum Matching}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {71:171:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959771092},
ISSN = {18688969},
year = {2019},
volume = {132},
editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10647},
URN = {urn:nbn:de:0030drops106477},
doi = {10.4230/LIPIcs.ICALP.2019.71},
annote = {Keywords: Matchings, Adaptive Analysis, Parameterized Complexity}
}
04.07.2019
Keywords: 

Matchings, Adaptive Analysis, Parameterized Complexity 
Seminar: 

46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)

Issue date: 

2019 
Date of publication: 

04.07.2019 