Pages that link to "Item:Q4916038"
From MaRDI portal
The following pages link to Constant Thresholds Can Make Target Set Selection Tractable (Q4916038):
Displaying 12 items.
- Exact solutions for latency-bounded target set selection problem on some special families of graphs (Q260041) (← links)
- Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs (Q897965) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- Fast and frugal targeting with incentives (Q2297851) (← links)
- Influence diffusion in social networks under time window constraints (Q2345457) (← links)
- Spread of influence in weighted networks under time and budget constraints (Q2347001) (← links)
- Latency-bounded target set selection in social networks (Q2447759) (← links)
- Influence Diffusion in Social Networks under Time Window Constraints (Q2868640) (← links)
- Optimizing Spread of Influence in Social Networks via Partial Incentives (Q3460711) (← links)
- A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks (Q3467846) (← links)
- Parameterized complexity of weighted target set selection (Q6636096) (← links)
