MVM is a new kernelization algorithm for bipartite maximum matching that applies Karp-Sipser reduction rules with a claimed O(min(m log n, n^2)) time bound on CSR-style storage and faster measured runtimes than existing KaSi variants.
Controllability of complex networks,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Efficient Kernelization Algorithm for Bipartite Graph Matching
MVM is a new kernelization algorithm for bipartite maximum matching that applies Karp-Sipser reduction rules with a claimed O(min(m log n, n^2)) time bound on CSR-style storage and faster measured runtimes than existing KaSi variants.