Spread of Influence in Weighted Networks under Time and Budget Constraints
Theor. Comput. Sci., Volume abs/1502.05599, Issue C, 2015, Pages 40-58.
Given a network represented by a weighted directed graph G, we consider the problem of finding a bounded cost set of nodes S such that the influence spreading from S in G, within a given time bound, is as large as possible. The dynamics that governs the spread of influence is the following: initially only elements in S are influenced; sub...More
PPT (Upload PPT)