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

@article{Korenwein2018DataRF,
  title={Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments},
  author={Viatcheslav Korenwein and Andr{\'e} Nichterlein and Philipp Zschoche and Rolf Niedermeier},
  journal={CoRR},
  year={2018},
  volume={abs/1806.09683}
}
Finding a maximum-cardinality or maximum-weight matching in (edge-weighted) undirected graphs is among the most prominent problems of algorithmic graph theory. For n-vertex and m-edge graphs, the best known algorithms run in Õ(m √ n) time. We build on recent theoretical work focusing on linear-time data reduction rules for finding maximum-cardinality… CONTINUE READING