Variants of Spreading Messages-Reference-Cited by-同舟云学术

Variants of Spreading Messages

Published:2010 Issue: Volume: Page:240-251
ISSN:0302-9743
Container-title:WALCOM: Algorithms and Computation
language:
Short-container-title:

Author:

Reddy T. V. Thirumala,Krishna D. Sai,Rangan C. Pandu

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-11440-3_22.pdf

Reference10 articles.

1. Chang, C.-L., Lyuu, Y.-D.: On irreversible dynamic monopolies in general graphs. CoRR abs/0904.2306 (2009)

2. Peleg, D.: Size bounds for dynamic monopolies. Discrete Applied Mathematics 86(2-3), 263–273 (1998)

3. Watts, D.: A simple model of global cascades on random networks. P. Natl. Acad. Sci. USA 99(9), 5766–5771 (2002)

4. Lecture Notes in Computer Science;P. Flocchini,1998

5. Luccio, F., Pagli, L., Sanossian, H.: Irreversible dynamos in butterflies. In: Gavoille, C., Bermond, J.C., Raspaud, A. (eds.) SIROCCO, pp. 204–218. Carleton Scientific (1999)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Establishing Herd Immunity is Hard Even in Simple Geometric Networks;Lecture Notes in Computer Science;2023

2. A biased random key genetic algorithm applied to target set selection in viral marketing;Proceedings of the Genetic and Evolutionary Computation Conference;2022-07-08

3. Constant Thresholds Can Make Target Set Selection Tractable;Theory of Computing Systems;2013-09-07

4. Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades;Theoretical Computer Science;2013-01

5. Constant Thresholds Can Make Target Set Selection Tractable;Lecture Notes in Computer Science;2012