The Power of Linear-Time Data Reduction for Maximum Matching
Work
Year: 2020
Type: article
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 $O(m\sqrt{n})$ t... more
Source: Algorithmica
Institutions Durham University, Technische Universität Berlin
Cites: 49
Cited by: 14
Related to: 10
FWCI: 1.252
Citation percentile (by year/subfield): 87.27
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,890