Finding the key nodes to minimize the victims of the malicious information in complex network

Mingyang Zhou, Hongwu Liu, Hao Liao, Gang Liu, Rui Mao

Abstract: Highlights•We characterize the influence of node set and influence redundancy among key nodes.•We prove that the objective function satisfies submodular property.•We propose a solution that has 1-1/e approximation ratio and time complexity O(N logN).