A. Arulselvan, C. W. Commander, L. Elefteriadou, and P. M. Pardalos, Detecting critical nodes in sparse graphs, Computers & Operations Research, vol.36, issue.7, pp.2193-2200, 2009.
DOI : 10.1016/j.cor.2008.08.016

R. Billinton and R. Allan, Reliability Evaluation of Engineering Systems, 1983.

S. P. Borgatti, Identifying sets of key players in a social network, Computational and Mathematical Organization Theory, vol.11, issue.6, pp.21-34, 2006.
DOI : 10.1007/s10588-006-7084-x

T. Camp, J. Boleng, and V. Davies, A survey of mobility models for ad hoc network research, Wireless Communications and Mobile Computing, vol.15, issue.5, pp.483-502, 2002.
DOI : 10.1002/wcm.72

C. ¸-etinkaya, E. K. Broyles, D. Dandekar, A. Srinivasan, S. Sterbenz et al., Modelling Communication Network Challenges for Future Internet Resilience, Survivability , and Disruption Tolerance: A Simulation-Based Approach, pp.1-16, 2011.

D. Summa, M. Grosso, A. Locatelli, and M. , Branch and cut algorithms for detecting critical nodes in undirected graphs, Computational Optimization and Applications, pp.1-32, 2012.

T. Dinh, Y. Xuan, M. Thai, E. Park, and T. Znati, On Approximation of New Optimization Methods for Assessing Network Vulnerability, 2010 Proceedings IEEE INFOCOM, pp.1-9, 2010.
DOI : 10.1109/INFCOM.2010.5462098

L. Freeman, Centrality in social networks conceptual clarification, Social Networks, vol.1, issue.3, pp.215-239, 1979.
DOI : 10.1016/0378-8733(78)90021-7

T. H. Kim, D. Tipper, P. Krishnamurthy, and A. Swindlehurst, Improving the topological resilience of mobile ad hoc networks, 2009 7th International Workshop on Design of Reliable Communication Networks, pp.191-197, 2009.
DOI : 10.1109/DRCN.2009.5340008

T. Kim, D. Tipper, and P. Krishnamurthy, Connectivity and critical point behavior in mobile ad hoc and sensor networks, 2009 IEEE Symposium on Computers and Communications, pp.153-158, 2009.
DOI : 10.1109/ISCC.2009.5202371

M. Kriesell, Minimal connectivity, Topics in Structural Graph Theory, pp.71-99, 2012.

M. E. Newman, Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality, Physical Review E, vol.64, issue.1, p.16132, 2001.
DOI : 10.1103/PhysRevE.64.016132

D. M. Nicol, W. H. Sanders, and K. S. Trivedi, Model-based evaluation: from dependability to security, IEEE Transactions on Dependable and Secure Computing, vol.1, issue.1, pp.48-65, 2004.
DOI : 10.1109/TDSC.2004.11

T. Opsahl, F. Agneessens, and J. Skvoretz, Node centrality in weighted networks: Generalizing degree and shortest paths, Social Networks, vol.32, issue.3, pp.245-251, 2010.
DOI : 10.1016/j.socnet.2010.03.006

S. Scellato, I. Leontiadis, C. Mascolo, P. Basu, and M. Zafer, Evaluating Temporal Robustness of Mobile Networks, IEEE Transactions on Mobile Computing, vol.12, issue.1, pp.105-117, 2013.
DOI : 10.1109/TMC.2011.248

S. Shen and J. C. Smith, Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs, Networks, vol.16, issue.2, pp.103-119, 2012.
DOI : 10.1002/net.20464

J. P. Sterbenz, D. Hutchison, E. K. Etinkaya, A. Jabbar, J. P. Rohrer et al., Resilience and survivability in communication networks: Strategies, principles, and survey of disciplines, Computer Networks, vol.54, issue.8, pp.1245-1265, 2010.
DOI : 10.1016/j.comnet.2010.03.005

J. P. Sterbenz, R. Krishnan, R. R. Hain, A. W. Jackson, D. Levin et al., Survivable mobile wireless networks, Proceedings of the ACM workshop on Wireless security , WiSE '02, pp.31-40, 2002.
DOI : 10.1145/570681.570685

J. Tang, M. Musolesi, C. Mascolo, and V. Latora, Temporal distance metrics for social network analysis, Proceedings of the 2nd ACM workshop on Online social networks, WOSN '09, pp.31-36, 2009.
DOI : 10.1145/1592665.1592674

D. Zhang, S. A. Gogi, D. S. Broyles, E. K. Etinkaya, and J. P. Sterbenz, Modelling attacks and challenges to wireless networks, 2012 IV International Congress on Ultra Modern Telecommunications and Control Systems, pp.806-812, 2012.
DOI : 10.1109/ICUMT.2012.6459774