Influence Diffusion in Social Networks under Time Window Constraints
From MaRDI portal
Publication:2868640
DOI10.1007/978-3-319-03578-9_12zbMath1408.91176OpenAlexW2029392249MaRDI QIDQ2868640
Joseph G. Peters, Ugo Vaccaro, Luisa Gargano, Pavol Hell
Publication date: 17 December 2013
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03578-9_12
Social networks; opinion dynamics (91D30) Graph algorithms (graph-theoretic aspects) (05C85) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)
Related Items (6)
Optimizing Spread of Influence in Social Networks via Partial Incentives ⋮ Pervasive domination ⋮ Latency-bounded target set selection in social networks ⋮ How to choose friends strategically ⋮ Whom to befriend to influence people ⋮ Spread of influence in weighted networks under time and budget constraints
Cites Work
- Unnamed Item
- Unnamed Item
- On dynamic monopolies of graphs with general thresholds
- Combinatorial model and bounds for target set selection
- Treewidth governs the complexity of target set selection
- Irreversible conversion of graphs
- Local majorities, coalitions and monopolies in graphs: A review
- On time versus size for monotone dynamic monopolies in regular topologies
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Some results on the target set selection problem
- Parameterized approximability of maximizing the spread of influence in networks
- Complex networks: structure and dynamics
- Diffusion in complex social networks
- On the Approximability of Influence in Social Networks
- Dynamical Processes on Complex Networks
- Constant Thresholds Can Make Target Set Selection Tractable
- Target Set Selection Problem for Honeycomb Networks
- Latency-Bounded Target Set Selection in Social Networks
- Automata, Languages and Programming
- Variants of Spreading Messages
This page was built for publication: Influence Diffusion in Social Networks under Time Window Constraints