Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search

DOI10.1287/IJOC.2022.0130MaRDI QIDQ6202329zbMATH OpenFDO

Authors Yangming Zhou, Jiaqi Li, Jin-Kao Hao, Fred Glover

Publication date 26 March 2024

Published in INFORMS Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

heuristic searchcritical node problemmemetic searchinstance reductionreduce-solve-combine

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• A fast greedy algorithm for the critical node detection problem
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
• A region growing algorithm for detecting critical nodes
• Detecting critical nodes in sparse graphs
• Solving the Distance-Based Critical Node Problem

This page was built for publication: Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search

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