Pages that link to "Item:Q410735"
From MaRDI portal
The following pages link to Combinatorial model and bounds for target set selection (Q410735):
Displaying 19 items.
- 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)
- Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485) (← links)
- Target Set Selection in Dense Graph Classes (Q5062113) (← links)
- Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)
- Fortification Against Cascade Propagation Under Uncertainty (Q5084610) (← links)
- An exact algorithm for robust influence maximization (Q5918920) (← links)
- Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis (Q5963653) (← links)
- Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree (Q6045404) (← links)
- Immune sets in monotone infection rules. Characterization and complexity (Q6064851) (← links)
- New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts (Q6065861) (← links)
- Weighted target set selection on trees and cycles (Q6087138) (← links)
- New ordering methods to construct contagious sets and induced degenerate subgraphs (Q6102104) (← links)
- Target set selection with maximum activation time (Q6110610) (← links)
- Target set selection in social networks with tiered influence and activation thresholds (Q6173934) (← links)
- Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs (Q6571269) (← links)
- Graph burning in community-based networks (Q6636996) (← links)
- Minimal zero forcing sets (Q6644905) (← links)
