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

DOI10.1007/s00500-016-2303-yzbMath1386.05183MaRDI QIDQ1746796

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

minimum connected dominating set; critical nodes identification; the number of close subsequences

Mathematics Subject Classification ID

05C82: Small world graphs, complex networks (graph-theoretic aspects)

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)