The Power of Linear-Time Data Reduction for Maximum Matching

Algorithmica, pp. 3521-3565, 2020.

Cited by: 0|Views7
EI

Abstract:

Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph primitives. For m-edge and n-vertex graphs, it is well-known to be solvable in \n$O(m\\sqrt{n})$\n\n time; however, for several applications this running time is still too slow. We investigate how linear-time (and almost linear-time) dat...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments