Critical node identification for complex network based on a novel minimum connected dominating set
Sign Up to like & getrecommendations! Published in 2017 at "Soft Computing"
DOI: 10.1007/s00500-016-2303-y
Abstract: Identifying critical nodes in complex networks aims to fragment a graph $$G = (V, E)$$G=(V,E) by removing a set of vertices R with cardinality $$\left| R \right| \le $$R≤ k, such that the residual graph… read more here.
Keywords: critical nodes; network; minimum connected; dominating set ... See more keywords