Selected Topics in Critical Element Detection

DOI10.1007/978-1-4614-4109-0_2zbMath1315.90060OpenAlexW168538502MaRDI QIDQ5260999

Jose L. Walteros, Panos M. Pardalos

Publication date: 1 July 2015

Published in: Applications of Mathematics and Informatics in Military Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-4109-0_2

zbMATH Keywords

critical node problemcritical clique detectioncritical element detection

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (13)

Hybrid constructive heuristics for the critical node problem ⋮ Critical node detection problem for complex network in undirected weighted networks ⋮ Fortification Against Cascade Propagation Under Uncertainty ⋮ Solving the Distance-Based Critical Node Problem ⋮ The bi-objective critical node detection problem ⋮ An integer programming framework for critical elements detection in graphs ⋮ Finding Critical Links for Closeness Centrality ⋮ Analysis of critical damage in the communication network. III: Analysis of internode flows ⋮ Graph signatures: identification and optimization ⋮ Analysis of critical damage in the communication network. I: Model and computational experiment ⋮ EIA-CNDP: an exact iterative algorithm for critical node detection problem ⋮ An approach to the analysis of possible structural damages in multicommodity network systems ⋮ Sequential Shortest Path Interdiction with Incomplete Information

Cites Work

• Unnamed Item
• Unnamed Item
• Identifying sets of key players in a social network
• Complexity of the critical node problem over trees
• Primal-dual approximation algorithms for integral flow and multicut in trees
• Facets of the clique partitioning polytope
• Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
• Detecting critical nodes in sparse graphs
• Most vital links and nodes in weighted networks
• Some simplified NP-complete graph problems
• Deterministic network interdiction
• A cutting plane algorithm for computing \(k\)-edge survivability of a network
• Epidemic dynamics on complex networks
• On the Stackelberg strategy in nonzero-sum games
• Shortest-path network interdiction
• Disconnecting graphs by removing vertices: a polyhedral approach
• Removing Arcs from a Network

This page was built for publication: Selected Topics in Critical Element Detection