Bound and exact methods for assessing link vulnerability in complex networks
From MaRDI portal
Publication:405658
DOI10.1007/s10878-014-9742-0zbMath1303.90114OpenAlexW2089268090MaRDI QIDQ405658
H. T. Nguyen, Thang N. Dinh, My T. Thai
Publication date: 5 September 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9742-0
Related Items
Minimum cost edge blocker clique problem, Exact algorithms for the minimum cost vertex blocker clique problem, Robustness of power-law networks: its assessment and optimization, A Fast Greedy Algorithm for the Critical Node Detection Problem, EIA-CNDP: an exact iterative algorithm for critical node detection problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Identifying sets of key players in a social network
- A derandomized approximation algorithm for the critical node detection problem
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
- Detecting critical nodes in sparse graphs
- Finding the anti-block vital edge of a shortest path between two nodes
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Exact identification of critical nodes in sparse networks via new compact formulations
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
- Collective dynamics of ‘small-world’ networks
- Disconnecting graphs by removing vertices: a polyhedral approach
- Lower Bounds for the Partitioning of Graphs
