论文信息 - The Key Player Problem

The Key Player Problem

The key player problem (KPP) consists of two separate sub-problems, which can be described at a general level as follows: 1. (KPP-1) Given a social network, find a set of k nodes (called a kp-set of order k) which, if removed, would maximally disrupt communication among the remaining nodes. 2. (KPP-2) Given a social network, find a kp-set of order k that is maximally connected to all other nodes.

S. Borgatti

[1] S. Borgatti,et al. Social Networks of Drug Users in High-Risk Sites: Finding the Connections , 2002, AIDS and Behavior.

[2] Valdis E. Krebs,et al. Uncloaking Terrorist Networks , 2002, First Monday.

[3] S. Borgatti,et al. The centrality of groups and classes , 1999 .

[4] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[5] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[6] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[7] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.