Latency-bounded target set selection in social networks
Authors:
- Ferdinando CicaleseFCFerdinando Cicalese
- Gennaro CordascoGennaro Cordasco
- Luisa GarganoLGLuisa Gargano
- Martin MilaničMMMartin Milanič
- Ugo VaccaroUVUgo Vaccaro
- 1 May 2014
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 535, 1-15
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- On the approximability and exact algorithms for vector domination and related problems in graphsDiscrete Applied Mathematics, 2013
- Target Set Selection Problem for Honeycomb NetworksSIAM Journal on Discrete Mathematics, 2013
- Some results on the target set selection problemJournal of Combinatorial Optimization, 2012
- On Bounded-Degree Vertex Deletion parameterized by treewidthDiscrete Applied Mathematics, 2012
- Irreversible conversion of graphsTheoretical Computer Science, 2011
- Treewidth governs the complexity of target set selectionDiscrete Optimization, 2011
- Combinatorial model and bounds for target set selectionTheoretical Computer Science, 2010
- Limited Memory, Categorization, and CompetitionMarketing Science, 2010
- On the Approximability of Influence in Social NetworksSIAM Journal on Discrete Mathematics, 2009
- On the Relationship Between Clique-Width and TreewidthSIAM Journal on Computing, 2005