An algorithm for critical nodes problem in social networks based on owen value

1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Discovering critical nodes in social networks has many important applications. For finding out the critical nodes and considering the widespread community structure in social networks, we obtain each node’s marginal contribution by Owen value. And then we can give a method for the solution of the critical node problem. We validate the feasibility and effectiveness of our method on two synthetic datasets and six real datasets. At the same time, the result obtained by using our method to analyze the terrorist network is in line with the actual situation.

Cite

CITATION STYLE

APA

Wang, X. G. (2014). An algorithm for critical nodes problem in social networks based on owen value. The Scientific World Journal, 2014. https://doi.org/10.1155/2014/414717

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free