Exact solutions for Latency-Bounded Target Set Selection Problem on some special families of graphs-Reference-Cited by-同舟云学术

Exact solutions for Latency-Bounded Target Set Selection Problem on some special families of graphs

Published:2016-04 Issue: Volume:203 Page:111-116
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Liu Xianliang,Yang Zishen,Wang Wei

Funder

National Natural Science Foundation of China

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference24 articles.

1. Combinatorial model and bounds for target set selection;Ackerman;Theoret. Comput. Sci.,2010

2. Treewidth governs the complexity of target set selection;Ben-Zwi;Discrete Optim.,2011

3. C. Chang, Y. Lyuu, Bounding the number of tolerable faults in majority-based systems, in: Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26–28, 2010. Proceedings, 2010, pp, 109–119.

4. On the approximability of influence in social networks;Chen;SIAM J. Discrete Math.,2009

5. C.Y. Chiang, L.H. Huang, W.T. Huang, H.G. Yeh, The Target Set Selection Problem on Cycle Permutation Graphs, Generalized Petersen Graphs and Torus Cordalis, 2011. arXiv:1112.1313.

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

1. Dynamic Path Relinking for the Target Set Selection problem;Knowledge-Based Systems;2023-10

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. Fast and frugal targeting with incentives;Theoretical Computer Science;2020-04

4. Whom to befriend to influence people;Theoretical Computer Science;2020-03

5. Time-Bounded Influence Diffusion with Incentives;Structural Information and Communication Complexity;2018