Abstract
Given a social network represented by a graph G, we consider the problem of finding a bounded cardinality set of nodes S with the property that the influence spreading from S in G is as large as possible. The dynamics that govern the spread of influence is the following: initially only elements in S are influenced; subsequently at each round, the set of influenced elements is augmented by all nodes in the network that have a sufficiently large number of already influenced neighbors. While it is known that the general problem is hard to solve - even in the approximate sense - we present exact polynomial time algorithms for trees, paths, cycles, and complete graphs. © 2014 Springer International Publishing.
Author supplied keywords
Cite
CITATION STYLE
Cicalese, F., Cordasco, G., Gargano, L., Milanič, M., Peters, J. G., & Vaccaro, U. (2014). How to go viral: Cheaply and quickly. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8496 LNCS, pp. 100–112). Springer Verlag. https://doi.org/10.1007/978-3-319-07890-8_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
