Critical node identification for complex network based on a novel minimum connected dominating set

DOI10.1007/S00500-016-2303-YMaRDI QIDQ1746796zbMATH OpenOpenAlexFDO

Authors Xianqiang Yang

Publication date 26 April 2018

Published in Soft Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00500-016-2303-y

zbMATH Keywords

critical nodes identificationminimum connected dominating setthe number of close subsequences

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Detecting critical nodes in sparse graphs
• The critical node detection problem in networks: a survey
• A fast greedy algorithm for the critical node detection problem
• Identifying critical nodes in complex networks based on multi-scale centrality algorithm
• A region growing algorithm for detecting critical nodes

Cites work

• Community structure in social and biological networks
• Exact identification of critical nodes in sparse networks via new compact formulations

Cited in

(9)

• Detecting critical nodes in sparse graphs
• Exact identification of critical nodes in sparse networks via new compact formulations
• Finding key node sets in complex networks based on improved discrete fireworks algorithm
• Analysis of complex network performance and heuristic node removal strategies
• Analysis of critical and redundant nodes in controlling directed and undirected complex networks using dominating sets
• scientific article; zbMATH DE number 841597 (Why is no real title available?)
• Identifying vital nodes in complex networks based on information entropy, minimum dominating set and distance
• Identifying critical nodes in complex networks based on multi-scale centrality algorithm
• Fragmenting complex network based on non-backtracking matrix

This page was built for publication: Critical node identification for complex network based on a novel minimum connected dominating set

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