On adaptive algorithms for maximum matching

04/25/2019
by   Falko Hegerfeld, et al.
0

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(√(n)m) and stands unbeaten since 1980. It is complemented by faster, often linear-time, algorithms for various special graph classes. Moreover, there are fast parameterized algorithms, e.g., time O(km n) relative to tree-width k, which outperform O(√(n)m) when the parameter is sufficiently small. We show that the Micali-Vazirani 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(√(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 Ω(km). Thus, any phase-based matching algorithm with linear-time phases obliviously interpolates between linear time for k=O(1) and the worst case of O(√(n)m) when k=Θ(n). We complement our findings by proving that the phase framework by itself still allows Ω(√(n)) phases, and hence time Ω(√(n)m), even on paths, cographs, and bipartite chain graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/26/2018

Efficient and adaptive parameterized algorithms on modular decompositions

We study the influence of a graph parameter called modular-width on the ...
research
06/25/2018

Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments

Finding a maximum-cardinality or maximum-weight matching in (edge-weight...
research
12/16/2021

Disconnected Matchings

In 2005, Goddard, Hedetniemi, Hedetniemi and Laskar [Generalized subgrap...
research
11/13/2017

Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs

A bipartite graph G=(U,V,E) is convex if the vertices in V can be linear...
research
07/12/2018

A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs

We give an Õ(n^7/5 (nC))-time algorithm to compute a minimum-cost maximu...
research
07/18/2021

Efficient algorithms for maximum induced matching problem in permutation and trapezoid graphs

We first design an 𝒪(n^2) solution for finding a maximum induced matchin...
research
01/29/2019

Computing Optimal Assignments in Linear Time for Graph Matching

Finding an optimal assignment between two sets of objects is a fundament...

Please sign up or login with your details

Forgot password? Click here to reset