☆
Karp-Sipser based kernels for bipartite graph matching
https://hal.inria.fr/hal-02350734/document
Authors: Kamer Kaya, Johannes Langguth, Ioannis Panagiotas, Bora Uçar
Liked by: Maximimi
Domains: Graph algorithmics
Tags: SIAM
Uploaded by: Maximimi
Upload date: 2020-06-05 14:12:04

Comments:

Nice paper! - Publicly available implementation: https://gitlab.inria.fr/bora-ucar/karp--sipser-reduction - I like Theorem 3.1 a lot! I'm thinking how to generalize it, adapt it, use it for other problems. - Would have liked to see experiments on larger graphs. - Is there any other Rules that could be considered in addition to Rules 1 and 2?
Reply
Maximimi at 2020-06-05 14:32:37

Please consider to register or login to comment on the paper.