Author:
Gaikwad Ajinkya,Maity Soumen
Funder
Ministry of Education, India
Publisher
Springer Science and Business Media LLC
Reference37 articles.
1. Aazami, A., Stilp, K.: Approximation algorithms and hardness for domination with propagation. SIAM J. Discrete Math. 23(3), 1382–1399 (2009)
2. Bagga, K., Beineke, L., Goddard, W., Lipman, M., Pippert, R.: A survey of integrity. Discrete Appl. Math. 37–38, 13–28 (1992)
3. Barefoot, C.A., Entringer, R., Swart, H.C.: Vulnerability in graphs—a comparative survey. J. Combin. Math. Combin. Comput. 1(38), 13–22 (1987)
4. Bazgan, C., Chopin, M.: The complexity of finding harmless individuals in social networks. Discrete Optim. 14(C), 170–182 (2014)
5. Bazgan, C., Chopin, M., Nichterlein, A., Sikora, F.: Parameterized approximability of maximizing the spread of influence in networks. In: Du, D.-Z., Zhang, G. (eds.) Computing and Combinatorics, pp. 543–554. Springer, Berlin (2013)