Late acceptance-based heuristic algorithms for identifying critical nodes of weighted graphs

Identifying critical nodes is an efficient way to analyze and apprehend the properties, structures, and functions of complex networks, which is a challenging NP-hard problem. This paper studies a node-weighted version of the critical node problem (NWCNP) that involves minimization of pairwise connec...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Knowledge-based systems Ročník 211; s. 106562
Hlavní autori:	Zhou, Yangming, Wang, Zhe, Jin, Yan, Fu, Zhang-Hua
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 09.01.2021 Elsevier Science Ltd
Predmet:	Acceptance Algorithms Classification Combinatorial optimization Constraints Critical node problem Experiments Graph theory Graphs Heuristic Late acceptance strategy Metaheuristics Minimization Neighborhoods Node-weighted graph Nodes Optimization Perturbation Property Search algorithms Upper bounds Weighting Node-weighted graph Critical node problem Combinatorial optimization Metaheuristics Late acceptance strategy
ISSN:	0950-7051, 1872-7409
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!