相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Complexity of the critical node problem over trees
Marco Di Summa et al.
COMPUTERS & OPERATIONS RESEARCH (2011)
Application of modal analysis in assessing attack vulnerability of complex networks
Irina Petreska et al.
COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION (2010)
Bilevel programming applied to power system vulnerability analysis under multiple contingencies
J. M. Arroyo
IET GENERATION TRANSMISSION & DISTRIBUTION (2010)
O(root log n) APPROXIMATION TO SPARSEST CUT IN (O)over-bar(n(2)) TIME
Sanjeev Arora et al.
SIAM JOURNAL ON COMPUTING (2010)
Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure
Timothy C. Matisziw et al.
COMPUTERS & OPERATIONS RESEARCH (2009)
Detecting critical nodes in sparse graphs
Ashwin Arulselvan et al.
COMPUTERS & OPERATIONS RESEARCH (2009)
Exploring the vulnerability of network infrastructure to disruption
Timothy C. Matisziw et al.
ANNALS OF REGIONAL SCIENCE (2009)
A Methodological Overview of Network Vulnerability Analysis
Alan T. Murray et al.
GROWTH AND CHANGE (2008)
The use of sparsest cuts to reveal the hierarchical community structure of social networks
Charles F. Mann et al.
SOCIAL NETWORKS (2008)
Survivable network design under optimal and heuristic interdiction scenarios
J. Cole Smith et al.
JOURNAL OF GLOBAL OPTIMIZATION (2007)
Critical network infrastructure analysis: interdiction and system flow
Alan T. Murray et al.
JOURNAL OF GEOGRAPHICAL SYSTEMS (2007)
Algorithms for discrete and continuous multicommodity flow network interdiction problems
Churlzu Lim et al.
IIE TRANSACTIONS (2007)
A graph-theoretic perspective on centrality
Stephen P. Borgatti et al.
SOCIAL NETWORKS (2006)
On the hardness of approximating MULTICUT and SPARSEST-CUT
Shuchi Chawla et al.
COMPUTATIONAL COMPLEXITY (2006)
Vital nodes, interconnected infrastructures, and the geographies of network survivability
TH Grubesic et al.
ANNALS OF THE ASSOCIATION OF AMERICAN GEOGRAPHERS (2006)
An O(√n)-approximation algorithm for directed sparsest cut
MT Hajiaghayi et al.
INFORMATION PROCESSING LETTERS (2006)
Design of survivable networks: A survey
H Kerivin et al.
NETWORKS (2005)
Vulnerability and protection of infrastructure networks
V Latora et al.
PHYSICAL REVIEW E (2005)
Model for cascading failures in complex networks
P Crucitti et al.
PHYSICAL REVIEW E (2004)
Sparsest cuts and concurrent flows in product graphs
P Bonsma
DISCRETE APPLIED MATHEMATICS (2004)
A cutting plane algorithm for computing k-edge survivability of a network
YS Myung et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2004)
A network survivability model for critical national infrastructures
DJ Houck et al.
BELL LABS TECHNICAL JOURNAL (2004)
Analysis of electric grid security under terrorist threat
J Salmeron et al.
IEEE TRANSACTIONS ON POWER SYSTEMS (2004)
Efficient immunization strategies for computer networks and populations
R Cohen et al.
PHYSICAL REVIEW LETTERS (2003)
Random graph models of social networks
MEJ Newman et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2002)
Error and attack tolerance of complex networks
R Albert et al.
NATURE (2000)
分享论文
