The following pages link to New bounds for contagious sets (Q418891):
Displaying 18 items.
- A note on the acquaintance time of random graphs (Q396895) (← links)
- Triggering cascades on strongly connected directed graphs (Q500995) (← links)
- Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees (Q511918) (← links)
- On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
- Contagious sets in dense graphs (Q1678088) (← links)
- On some tractable and hard instances for partial incentives and target set selection (Q2010927) (← links)
- On the spread of influence in graphs (Q2051833) (← links)
- Minimum degree conditions for small percolating sets in bootstrap percolation (Q2185227) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- The acquaintance time of (percolated) random geometric graphs (Q2346592) (← links)
- Minimal contagious sets in random regular graphs (Q2350108) (← links)
- Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives (Q2421880) (← links)
- Acquaintance Time of Random Graphs Near Connectivity Threshold (Q2801332) (← links)
- On giant components and treewidth in the layers model (Q2811162) (← links)
- Recoverable Values for Independent Sets (Q3012827) (← links)
- Deterministic bootstrap percolation on trees (Q5045263) (← links)
- New ordering methods to construct contagious sets and induced degenerate subgraphs (Q6102104) (← links)
- Hierarchical cycle-tree packing model for optimal \(K\)-core attack (Q6140935) (← links)
