A deletion-based exact algorithm for maximum k-biplex search achieves worst-case time O*(γ_k^n) with γ_k < 2 and up to four orders of magnitude practical speedup over prior state-of-the-art.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion
A deletion-based exact algorithm for maximum k-biplex search achieves worst-case time O*(γ_k^n) with γ_k < 2 and up to four orders of magnitude practical speedup over prior state-of-the-art.