The following pages link to Spreading messages (Q1029342):
Displaying 13 items.
- On non-progressive spread of influence through social networks (Q401306) (← links)
- On dynamic monopolies of graphs with general thresholds (Q409449) (← links)
- Combinatorial model and bounds for target set selection (Q410735) (← links)
- On dynamic monopolies of graphs: the average and strict majority thresholds (Q448965) (← links)
- Spreading of messages in random graphs (Q633767) (← links)
- Dynamic monopolies with randomized starting configuration (Q653331) (← links)
- Triggering cascades on undirected connected graphs (Q1944178) (← links)
- On reversible cascades in scale-free and Erdős-Rényi random graphs (Q1946489) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- An inclusion hierarchy of irreversible dynamos (Q2355698) (← links)
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks (Q2449109) (← links)
- ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS (Q2933686) (← links)
