dentifying critical nodes in complex networks aims to fragment a graph G = (V, E) by removing a set of vertices R with cardinality |R| ≤ k, such that the
residual graph has minimum pairwise connectivity. Exist- ing optimization algorithms are incapable of finding a good set R in complex networks. By investigating the role of nodes, a minimum dominating set approach is considered in controlling a network. This paper presents an algorithmic
procedure to compute the critical nodes using a novel mini- mum connected dominating set, in which the critical nodes are identified based on the number of close subsequences. Through experimental verification on some randomly gener- ated networks and comparing with the similar algorithms, the results showed that the proposed algorithm has high capability of identifying the critical nodes and low time complexity.