An O(n^5) exact algorithm for broadcast domination obtained by reducing the path-case to O(n^3) via a single DAG on oriented broadcast balls.
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
CONDITIONAL 1representative citing papers
citing papers explorer
-
An $O(n^5)$-Time Algorithm for Optimal Broadcast Domination
An O(n^5) exact algorithm for broadcast domination obtained by reducing the path-case to O(n^3) via a single DAG on oriented broadcast balls.