Bound and exact methods for assessing link vulnerability in complex networks
From MaRDI portal
Publication:405658
DOI10.1007/S10878-014-9742-0zbMATH Open1303.90114OpenAlexW2089268090MaRDI QIDQ405658FDOQ405658
Thang N. Dinh, H. T. Nguyen, 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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Collective dynamics of ‘small-world’ networks
- Identifying sets of key players in a social network
- Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
- Detecting critical nodes in sparse graphs
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- 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
- A derandomized approximation algorithm for the critical node detection problem
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
- Lower Bounds for the Partitioning of Graphs
- Finding the anti-block vital edge of a shortest path between two nodes
- Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems
- Disconnecting graphs by removing vertices: a polyhedral approach
Cited In (9)
- Minimum cost edge blocker clique problem
- EIA-CNDP: an exact iterative algorithm for critical node detection problem
- Title not available (Why is that?)
- A Fast Greedy Algorithm for the Critical Node Detection Problem
- Exact algorithms for the minimum cost vertex blocker clique problem
- Title not available (Why is that?)
- Robustness of power-law networks: its assessment and optimization
- Union of random minkowski sums and network vulnerability analysis
- On a function for the vulnerability of a directed flow network
Uses Software
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)
