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

DOI10.1007/S00500-016-2303-YzbMath1386.05183OpenAlexW2516141042MaRDI 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 setcritical nodes identificationthe number of close subsequences

Mathematics Subject Classification ID

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

Cites Work

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

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