Mader's S-path packing admits a deterministic O(mnk) time algorithm, improving the previous best deterministic bound O(mn^omega).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Faster Deterministic Algorithm for Mader's $\mathcal{S}$-Path Packing
Mader's S-path packing admits a deterministic O(mnk) time algorithm, improving the previous best deterministic bound O(mn^omega).