Pages that link to "Item:Q2254488"
From MaRDI portal
The following pages link to Constant thresholds can make target set selection tractable (Q2254488):
Displaying 22 items.
- Approximate association via dissociation (Q505447) (← links)
- The complexity of finding effectors (Q519899) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Discovering small target sets in social networks: a fast and effective algorithm (Q1635708) (← links)
- Active influence spreading in social networks (Q1731507) (← 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)
- Whom to befriend to influence people (Q2292915) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- On the complexity of the vector connectivity problem (Q2354404) (← links)
- Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
- Domination and convexity problems in the target set selection model (Q2689641) (← links)
- Evangelism in Social Networks (Q2819494) (← links)
- Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485) (← links)
- (Q5092394) (← links)
- Target set selection with maximum activation time (Q6110610) (← links)
- On Structural Parameterizations of the Harmless Set Problem (Q6492087) (← links)
