A region growing algorithm for detecting critical nodes

DOI10.1007/978-3-319-12691-3_44MaRDI QIDQ2942434zbMATH OpenOpenAlexFDO

Authors M. 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

zbMATH Keywords

region growing bicriteria approximation algorithmsolutions to the critical node detection problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• A derandomized approximation algorithm for the critical node detection problem
• A fast greedy algorithm for the critical node detection problem
• scientific article; zbMATH DE number 7059791
• Detecting critical nodes in sparse graphs
• Selected topics in critical element detection

Cites work

• 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
• Approximate max-flow min-(multi)cut theorems and their applications
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• Complexity of the critical node problem over trees
• Detecting critical nodes in sparse graphs
• Exact identification of critical nodes in sparse networks via new compact formulations
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
• Inoculation strategies for victims of viruses and the sum-of-squares partition problem
• The design of approximation algorithms

Cited in

(11)

• Critical node identification for complex network based on a novel minimum connected dominating set
• The critical node detection problem in networks: a survey
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
• EIA-CNDP: an exact iterative algorithm for critical node detection problem
• Complexity of the multilevel critical node problem
• Critical node detection problem for complex network in undirected weighted networks
• A fast greedy algorithm for the critical node detection problem
• A randomized algorithm with local search for containment of pandemic disease spread
• Computing critical nodes in directed graphs
• Selected topics in critical element detection
• Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search

This page was built for publication: A region growing algorithm for detecting critical nodes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942434)