Pages that link to "Item:Q5326360"
From MaRDI portal
The following pages link to Latency-Bounded Target Set Selection in Social Networks (Q5326360):
Displayed 9 items.
- Exact solutions for latency-bounded target set selection problem on some special families of graphs (Q260041) (← links)
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- Whom to befriend to influence people (Q2292915) (← links)
- Fast and frugal targeting with incentives (Q2297851) (← links)
- Influence diffusion in social networks under time window constraints (Q2345457) (← links)
- On the complexity of the vector connectivity problem (Q2354404) (← links)
- Influence Diffusion in Social Networks under Time Window Constraints (Q2868640) (← links)
- Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339) (← links)
- How to choose friends strategically (Q5919425) (← links)