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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Knowledge-based systems Jg. 211; S. 106562
Hauptverfasser:	Zhou, Yangming, Wang, Zhe, Jin, Yan, Fu, Zhang-Hua
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 09.01.2021 Elsevier Science Ltd
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!