Pages that link to "Item:Q2447759"
From MaRDI portal
The following pages link to Latency-bounded target set selection in social networks (Q2447759):
Displaying 19 items.
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Discovering small target sets in social networks: a fast and effective algorithm (Q1635708) (← links)
- Active influence spreading in social networks (Q1731507) (← links)
- Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
- The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs (Q2025100) (← links)
- Target set selection parameterized by vertex cover and more (Q2082561) (← links)
- Vector domination in split-indifference graphs (Q2281167) (← links)
- Whom to befriend to influence people (Q2292915) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- Spread of influence in weighted networks under time and budget constraints (Q2347001) (← links)
- Generalized threshold processes on graphs (Q2402258) (← links)
- Domination and convexity problems in the target set selection model (Q2689641) (← links)
- Evangelism in Social Networks (Q2819494) (← links)
- Multi-level dynamo and opinion spreading (Q2971065) (← 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)
- Target Set Selection in Dense Graph Classes (Q5062113) (← links)
- Target set selection with maximum activation time (Q6110610) (← links)
