Efficient heuristic algorithm for identifying critical nodes in planar networks

DOI10.1016/j.cor.2019.02.006zbMath1458.90622OpenAlexW2912165095WikidataQ128349401 ScholiaQ128349401MaRDI QIDQ1734834

Dalaijargal Purevsuren, Gang Cui

Publication date: 27 March 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.02.006

zbMATH Keywords

heuristicscombinatorial optimizationNP-completecritical node detectionplanar networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

Identifying influential spreaders in complex networks based on improved k-shell method ⋮ Critical node detection problem for complex network in undirected weighted networks ⋮ The minimum cost network upgrade problem with maximum robustness to multiple node failures

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• Hybrid constructive heuristics for the critical node problem
• Detecting critical nodes in sparse graphs
• Some simplified NP-complete graph problems
• The bi-objective critical node detection problem
• 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
• A Separator Theorem for Planar Graphs
• Engineering planar separator algorithms

This page was built for publication: Efficient heuristic algorithm for identifying critical nodes in planar networks