Karp-Sipser based kernels for bipartite graph matching

DOI10.1137/1.9781611976007.11MaRDI QIDQ5147504zbMATH OpenOpenAlexFDO

Authors Kamer Kaya, Johannes Langguth, Ioannis Panagiotas, Bora Uçar

Publication date 27 January 2021

Published in 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611976007.11

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• Data Reduction for Maximum Matching on Real-World Graphs
• scientific article; zbMATH DE number 7651215 (Why is no real title available?)
• Matching algorithms in the sparse stochastic block model

This page was built for publication: Karp-Sipser based kernels for bipartite graph matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5147504)