Funder
National Natural Science Foundation of China
National Research University Higher School of Economics
Publisher
Springer Science and Business Media LLC
Reference25 articles.
1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs, NJ (1993)
2. Albert, R., Jeong, H., Barabasi, A.: Error and attack tolerance of complex networks. Nature 406(6794), 378–382 (2000)
3. Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V., Rudolf, G., Zhao, J.: On short paths interdiction problems: total and node-wise limited interdiction. Theory Comput. Syst. 43(2), 204–233 (2008)
4. Corley, H.W., Sha, D.Y.: Most vital links and nodes in weighted networks. Oper. Res. Lett. 1, 157–161 (1982)
5. Bar-Noy, A., Khuller, S., Schieber, B.: The complexity of finding most vital arcs¡¡ and nodes, Technical Report CS-TR-3539. University of Maryland, Department of Computer Science (1995)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献