Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Discovering important nodes through graph entropy the case of Enron email database
Proceedings of the 3rd international workshop on Link discovery
Finding the most prominent group in complex networks
AI Communications - Network Analysis in Natural Sciences and Engineering
Key figure impact in trust-enhanced recommender systems
AI Communications - Recommender Systems
Detecting critical nodes in sparse graphs
Computers and Operations Research
An Information Theory Approach to Identify Sets of Key Players
EuroISI '08 Proceedings of the 1st European Conference on Intelligence and Security Informatics
Robustness of centrality measures under uncertainty: Examining the role of network topology
Computational & Mathematical Organization Theory
On approximation of new optimization methods for assessing network vulnerability
INFOCOM'10 Proceedings of the 29th conference on Information communications
The small core of the German corporate board network
Computational & Mathematical Organization Theory
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
Finding critical nodes for inhibiting diffusion of complex contagions in social networks
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part II
Optimization-based influencing of village social networks in a counterinsurgency
SBP'11 Proceedings of the 4th international conference on Social computing, behavioral-cultural modeling and prediction
Complexity of the critical node problem over trees
Computers and Operations Research
Robustness of social networks: comparative results based on distance distributions
SocInfo'11 Proceedings of the Third international conference on Social informatics
Stability analysis of biological network topologies during stochastic simulation
Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
Robustness of centrality measures against link weight quantization in social network analysis
Proceedings of the Fourth Annual Workshop on Simplifying Complex Networks for Practitioners
Controlling infection by blocking nodes and links simultaneously
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
On new approaches of assessing network vulnerability: hardness and approximation
IEEE/ACM Transactions on Networking (TON)
All online friends are not created equal: discovering influence structure in online social networks
Proceedings of the 14th Annual International Conference on Electronic Commerce
A decomposition approach for solving critical clique detection problems
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Structural Search and Optimization in Social Networks
INFORMS Journal on Computing
Critical infrastructure management for telecommunication networks
AMT'12 Proceedings of the 8th international conference on Active Media Technology
Optimization-based influencing of village social networks in a counterinsurgency
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Sections on Paraphrasing; Intelligent Systems for Socially Aware Computing; Social Computing, Behavioral-Cultural Modeling, and Prediction
Multi-objective restructuring in social networks
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Network interdiction via a Critical Disruption Path: Branch-and-Price algorithms
Computers and Operations Research
Topology control for wireless mesh networks based on centrality metrics
Proceedings of the 10th ACM symposium on Performance evaluation of wireless ad hoc, sensor, & ubiquitous networks
Proceedings of the 3rd International Web Science Conference
Effective co-betweenness centrality computation
Proceedings of the 7th ACM international conference on Web search and data mining
Weighted graph-based methods for identifying the most influential actors in trust social networks
International Journal of Networking and Virtual Organisations
| Hi-index | 0.00 |
A procedure is described for finding sets of key players in a social network. A key assumption is that the optimal selection of key players depends on what they are needed for. Accordingly, two generic goals are articulated, called KPP-POS and KPP-NEG. KPP-POS is defined as the identification of key players for the purpose of optimally diffusing something through the network by using the key players as seeds. KPP-NEG is defined as the identification of key players for the purpose of disrupting or fragmenting the network by removing the key nodes. It is found that off-the-shelf centrality measures are not optimal for solving either generic problem, and therefore new measures are presented.