Bound and exact methods for assessing link vulnerability in complex networks
From MaRDI portal
(Redirected from Publication:405658)
Recommendations
- Vulnerability Assessment of Spatial Networks: Models and Solutions
- Link vulnerability in networks
- Vulnerability analysis of interdependent network via integer programming approaches
- Effective measurement of network vulnerability under random and intentional attacks
- scientific article; zbMATH DE number 4145634
Cites work
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A derandomized approximation algorithm for the critical node detection problem
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Collective dynamics of `small-world' networks
- Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- Detecting critical nodes in sparse graphs
- Disconnecting graphs by removing vertices: a polyhedral approach
- Exact identification of critical nodes in sparse networks via new compact formulations
- Finding the anti-block vital edge of a shortest path between two nodes
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Identifying sets of key players in a social network
- Lower Bounds for the Partitioning of Graphs
- Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
Cited in
(10)- Exact algorithms for the minimum cost vertex blocker clique problem
- Union of random minkowski sums and network vulnerability analysis
- Topological data analysis for network resilience quantification
- Minimum cost edge blocker clique problem
- EIA-CNDP: an exact iterative algorithm for critical node detection problem
- scientific article; zbMATH DE number 6836971 (Why is no real title available?)
- scientific article; zbMATH DE number 4145634 (Why is no real title available?)
- Robustness of power-law networks: its assessment and optimization
- A fast greedy algorithm for the critical node detection problem
- On a function for the vulnerability of a directed flow network
This page was built for publication: Bound and exact methods for assessing link vulnerability in complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405658)
