A Region Growing Algorithm for Detecting Critical Nodes
From MaRDI portal
Publication:2942434
DOI10.1007/978-3-319-12691-3_44zbMath1433.05301OpenAlexW301598401MaRDI QIDQ2942434
Mario Ventresca, Dionne M. Aleman
Publication date: 11 September 2015
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_44
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (4)
Complexity of the multilevel critical node problem ⋮ Critical node detection problem for complex network in undirected weighted networks ⋮ The critical node detection problem in networks: a survey ⋮ EIA-CNDP: an exact iterative algorithm for critical node detection problem
Cites Work
- Unnamed Item
- A derandomized approximation algorithm for the critical node detection problem
- A randomized algorithm with local search for containment of pandemic disease spread
- An integer programming framework for critical elements detection in graphs
- Complexity of the critical node problem over trees
- Detecting critical nodes in sparse graphs
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- 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
- The Design of Approximation Algorithms
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximate max-flow min-(multi)cut theorems and their applications
This page was built for publication: A Region Growing Algorithm for Detecting Critical Nodes
