The following pages link to Irreversible conversion of graphs (Q551200):
Displayed 15 items.
- ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS (Q2933686) (← links)
- The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results (Q2945205) (← 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)
- Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs (Q4990134) (← links)
- Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485) (← links)
- Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms (Q5859672) (← links)
- Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree (Q6045404) (← links)
- On the monophonic rank of a graph (Q6045452) (← links)
- New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts (Q6065861) (← links)
- On the hull number on cycle convexity of graphs (Q6072203) (← links)
- Target set selection with maximum activation time (Q6110610) (← links)
- Complete characterizations of the 2-domination and \(\mathcal{P}_3\)-hull number polytopes (Q6166039) (← links)
- Irreversible <i>k</i>-threshold conversion number of some graphs (Q6203380) (← links)