Pages that link to "Item:Q1956258"
From MaRDI portal
The following pages link to Some results on the target set selection problem (Q1956258):
Displaying 33 items.
- Exact solutions for latency-bounded target set selection problem on some special families of graphs (Q260041) (← links)
- Diffusion centrality: a paradigm to maximize spread in social networks (Q322073) (← 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)
- Dynamic monopolies for interval graphs with bounded thresholds (Q1741518) (← links)
- On some tractable and hard instances for partial incentives and target set selection (Q2010927) (← 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)
- On reconfigurability of target sets (Q2110378) (← links)
- On the harmless set problem parameterized by treewidth (Q2154099) (← links)
- Target set selection on generalized pancake graphs (Q2195642) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- Whom to befriend to influence people (Q2292915) (← links)
- Fast and frugal targeting with incentives (Q2297851) (← links)
- Partial immunization of trees (Q2299985) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← 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)
- A global optimization algorithm for target set selection problems (Q2629957) (← links)
- Vaccinate your trees! (Q2632015) (← links)
- Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems (Q2669540) (← links)
- Evangelism in Social Networks (Q2819494) (← links)
- Influence Diffusion in Social Networks under Time Window Constraints (Q2868640) (← links)
- ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS (Q2933686) (← 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)
- Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis (Q5963653) (← links)
- Weighted target set selection on trees and cycles (Q6087138) (← links)
- Target set selection with maximum activation time (Q6110610) (← links)
- On Structural Parameterizations of the Harmless Set Problem (Q6492087) (← links)
