Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference13 articles.
1. Ackerman, E., Ben-Zwi, O., & Wolfovitz, G. (2010). Combinatorial model and bounds for target set selection. Theoretical Computer Science, 411(44–46), 4017–4022.
https://doi.org/10.1016/j.tcs.2010.08.021
.
2. Chang, C. L., & Lyuu, Y. D. (2013). Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades. Theoretical Computer Science, 468, 37–49.
https://doi.org/10.1016/j.tcs.2012.11.016
,
http://www.sciencedirect.com/science/article/pii/S0304397512010468
.
3. Flocchini, P., Lodi, E., Luccio, F., Pagli, L., & Santoro, N. (2004). Dynamic monopolies in Tori. Discrete Applied Mathematics 137(2):197–212.
https://doi.org/10.1016/S0166-218X(03)00261-0
, 1st international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN ’99)
4. Günneç, D., Raghavan, S., & Zhang, R. (2017). Tailored incentives and least cost influence maximization on social networks.
http://terpconnect.umd.edu/~raghavan/preprints/LCIP.pdf
5. Hammer, P. L., Johnson, E. L., & Peled, U. N. (1975). Facets of regular 0–1 polytopes. Mathematical Programming, 8, 179–206.
https://doi.org/10.1007/BF01580442
.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献