Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs
DOI10.1007/s10878-024-01164-4MaRDI QIDQ6571269
Manouchehr Zaker, Siavash Askari
Publication date: 11 July 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
directed graphstarget set selectionspread of influencedynamic monopolytarget vectoredge-weighted graphs
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- On dynamic monopolies of graphs with general thresholds
- Combinatorial model and bounds for target set selection
- On dynamic monopolies of graphs: the average and strict majority thresholds
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Active influence spreading in social networks
- On time versus size for monotone dynamic monopolies in regular topologies
- On some tractable and hard instances for partial incentives and target set selection
- Target set selection for conservative populations
- Whom to befriend to influence people
- Fast and frugal targeting with incentives
- Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
- On irreversible spread of influence in edge-weighted graphs
- Least-Cost Influence Maximization on Social Networks
- Optimizing Spread of Influence in Social Networks via Partial Incentives
- On the Approximability of Influence in Social Networks
- How to choose friends strategically
- Weighted target set selection on trees and cycles
- A branch‐and‐cut approach for the least cost influence problem on social networks
This page was built for publication: Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs
