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

Full description

Saved in:

Bibliographic Details
Published in:	Knowledge-based systems Vol. 211; p. 106562
Main Authors:	Zhou, Yangming, Wang, Zhe, Jin, Yan, Fu, Zhang-Hua
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 09.01.2021 Elsevier Science Ltd
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!