Pages that link to "Item:Q456700"
From MaRDI portal
The following pages link to Treewidth governs the complexity of target set selection (Q456700):
Displayed 29 items.
- Exact solutions for latency-bounded target set selection problem on some special families of graphs (Q260041) (← links)
- The complexity of finding effectors (Q519899) (← links)
- On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Discovering small target sets in social networks: a fast and effective algorithm (Q1635708) (← links)
- Least cost influence propagation in (social) networks (Q1650779) (← links)
- Active influence spreading in social networks (Q1731507) (← links)
- Dynamic monopolies for interval graphs with bounded thresholds (Q1741518) (← links)
- Some results on the target set selection problem (Q1956258) (← links)
- On some tractable and hard instances for partial incentives and target set selection (Q2010927) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- Whom to befriend to influence people (Q2292915) (← links)
- Partial immunization of trees (Q2299985) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- Parameterizations of hitting set of bundles and inverse scope (Q2344004) (← 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)
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks (Q2449109) (← links)
- Vaccinate your trees! (Q2632015) (← links)
- Evangelism in Social Networks (Q2819494) (← links)
- Influence Diffusion in Social Networks under Time Window Constraints (Q2868640) (← links)
- On irreversible spread of influence in edge-weighted graphs (Q3303530) (← 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)
- Structure of Graphs with Locally Restricted Crossings (Q5346557) (← links)
- How to choose friends strategically (Q5919425) (← links)
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis (Q5963653) (← links)