Faster FPT algorithms for Telephone Broadcast achieve 2^{O(vc log vc)}, 2^{O(vi^2 log vi)}, and 2^{O(k log k)} n^{O(1)} time via reduction to b-Matching.
Collins and David Kempe and Jared Saia and Maxwell Young , title =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Faster Parameterized Broadcasting
Faster FPT algorithms for Telephone Broadcast achieve 2^{O(vc log vc)}, 2^{O(vi^2 log vi)}, and 2^{O(k log k)} n^{O(1)} time via reduction to b-Matching.