4.3 Article

Bound and exact methods for assessing link vulnerability in complex networks

Related references

Note: Only part of the references are listed.
Article Computer Science, Interdisciplinary Applications

A derandomized approximation algorithm for the critical node detection problem

Mario Ventresca et al.

COMPUTERS & OPERATIONS RESEARCH (2014)

Article Operations Research & Management Science

Exact identification of critical nodes in sparse networks via new compact formulations

Alexander Veremyev et al.

OPTIMIZATION LETTERS (2014)

Article Computer Science, Hardware & Architecture

On the Discovery of Critical Links and Nodes for Assessing Network Vulnerability

Yilin Shen et al.

IEEE-ACM TRANSACTIONS ON NETWORKING (2013)

Article Computer Science, Interdisciplinary Applications

Complexity of determining the most vital elements for the p-median and p-center location problems

Cristina Bazgan et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2013)

Article Computer Science, Interdisciplinary Applications

Critical edges/nodes for the minimum spanning tree problem: complexity and approximation

Cristina Bazgan et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2013)

Article Operations Research & Management Science

Branch and cut algorithms for detecting critical nodes in undirected graphs

Marco Di Summa et al.

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2012)

Article Computer Science, Hardware & Architecture

Assessing the Vulnerability of the Fiber Infrastructure to Disasters

Sebastian Neumayer et al.

IEEE-ACM TRANSACTIONS ON NETWORKING (2011)

Article Computer Science, Interdisciplinary Applications

Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure

Timothy C. Matisziw et al.

COMPUTERS & OPERATIONS RESEARCH (2009)

Article Computer Science, Interdisciplinary Applications

Detecting critical nodes in sparse graphs

Ashwin Arulselvan et al.

COMPUTERS & OPERATIONS RESEARCH (2009)

Article Development Studies

A Methodological Overview of Network Vulnerability Analysis

Alan T. Murray et al.

GROWTH AND CHANGE (2008)

Article Computer Science, Interdisciplinary Applications

Finding the anti-block vital edge of a shortest path between two nodes

Bing Su et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2008)

Article Statistics & Probability

Disconnecting graphs by removing vertices: a polyhedral approach

Maarten Oosten et al.

STATISTICA NEERLANDICA (2007)

Article Physics, Fluids & Plasmas

Structural vulnerability of the North American power grid

R Albert et al.

PHYSICAL REVIEW E (2004)

Article Multidisciplinary Sciences

Error and attack tolerance of complex networks

R Albert et al.

NATURE (2000)

Article Physics, Multidisciplinary

Scale-free characteristics of random networks:: the topology of the World-Wide Web

AL Barabási et al.

PHYSICA A (2000)