Abstract
We consider Karp-Sipser, a well known matching heuristic in the context of data reduction for the maximum cardinality matching problem. We describe an efficient implementation as well as modifications to reduce its time complexity in worst case instances, both in theory and in practical cases. We compare experimentally against its widely used simpler variant and show cases for which the full algorithm yields better performance.
Cite
CITATION STYLE
Kaya, K., Langguth, J., Panagiotas, I., & Uçar, B. (2020). Karp-Sipser based kernels for bipartite graph matching. In Proceedings of the Workshop on Algorithm Engineering and Experiments (Vol. 2020-January, pp. 134–145). Society for Industrial and Applied Mathematics Publications. https://doi.org/10.1137/1.9781611976007.11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
