An improved dynamic programming algorithm computes exact influence spread in O((m+n) ω_p² 2^{ω_p²}) time on directed graphs of pathwidth ω_p by sharing repetitive subcomputations.
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
UNVERDICTED 1representative citing papers
citing papers explorer
-
Linear-Time Exact Computation of Influence Spread on Bounded-Pathwidth Graphs
An improved dynamic programming algorithm computes exact influence spread in O((m+n) ω_p² 2^{ω_p²}) time on directed graphs of pathwidth ω_p by sharing repetitive subcomputations.