Quantifying all-to-one network topology robustness under budget constraints
暂无分享,去创建一个
[1] Alan T. Murray,et al. Comparative Approaches for Assessing Network Vulnerability , 2008 .
[2] Beom Jun Kim,et al. Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[3] Jean C. Walrand,et al. How to Choose Communication Links in an Adversarial Environment? , 2011, GAMENETS.
[4] Vladimir Marbukh,et al. A Game-Theoretic Framework for Network Security Vulnerability Assessment and Mitigation , 2012, GameSec.
[5] Hans J. Herrmann,et al. Mitigation of malicious attacks on networks , 2011, Proceedings of the National Academy of Sciences.
[6] Levente Buttyán,et al. Game-theoretic Robustness of Many-to-one Networks , 2012, GAMENETS.
[7] Cristopher Moore,et al. Computational Complexity and Statistical Physics , 2006, Santa Fe Institute Studies in the Sciences of Complexity.
[8] William H. Cunningham,et al. Optimal attack and reinforcement of a network , 1985, JACM.
[9] Levente Buttyán,et al. Linear Loss Function for the Network Blocking Game: An Efficient Model for Measuring Network Robustness and Link Criticality , 2012, GameSec.
[10] Jean C. Walrand,et al. Design of Network Topology in an Adversarial Environment , 2010, GameSec.
[11] Stephan Mertens. The Easiest Hard Problem: Number Partitioning , 2006, Computational Complexity and Statistical Physics.