Identifying sets of key players in a social network

Recommendations

Identifying Key Nodes in Social Networks Using Multi-Criteria Decision-Making Tools
Identifying stable network structures and sets of key players using a \(W\)-covering perspective
Identifying a set of key members in social networks using SDP-based stochastic search and integer programming algorithms

Cites work

An Efficient Heuristic Procedure for Partitioning Graphs
Future paths for integer programming and links to artificial intelligence
scientific article; zbMATH DE number 17956 (Why is no real title available?)
scientific article; zbMATH DE number 3497315 (Why is no real title available?)
The centrality of groups and classes

Cited in

(67)

Detecting critical nodes in sparse graphs
An optimal approach for the critical node problem using semidefinite programming
Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
Least cost influence propagation in (social) networks
Improved formulations for minimum connectivity network interdiction problems
The bi-objective critical node detection problem
Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results
The critical node detection problem in networks: a survey
Tackling information asymmetry in networks: a new entropy-based ranking index
Exact interdiction models and algorithms for disconnecting networks via node deletions
Regularity of dynamic opinion games
Energy disruptive centrality with an application to criminal network
EIA-CNDP: an exact iterative algorithm for critical node detection problem
Identification of node centrality based on Laplacian energy of networks
Compressive sensing of high betweenness centrality nodes in networks
A new method for centrality measurement using generalized fuzzy graphs
Critical node detection problem for complex network in undirected weighted networks
A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality
Optimizing node infiltrations in complex networks by a local search based heuristic
Group centralization of network indices
What distinguish one from its peers in social networks?
Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
Exact identification of critical nodes in sparse networks via new compact formulations
VNS solutions for the critical node problem
Efficient methods for the distance-based critical node detection problem in complex networks
The connected critical node problem
Hybrid constructive heuristics for the critical node problem
Identifying Key Nodes in Social Networks Using Multi-Criteria Decision-Making Tools
Structural search and optimization in social networks
Component-cardinality-constrained critical node problem in graphs
Analysis of complex network performance and heuristic node removal strategies
A genetic algorithm for a class of critical node problems
Network interdiction via a critical disruption path: branch-and-price algorithms
Bound and exact methods for assessing link vulnerability in complex networks
An integer programming framework for critical elements detection in graphs
Identifying stable network structures and sets of key players using a \(W\)-covering perspective
Complexity among combinatorial problems from epidemics
Detecting critical node structures on graphs: a mathematical programming approach
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
The critical node problem based on connectivity index and properties of components on trees
Vulnerability and controllability of networks of networks
Solving the Distance-Based Critical Node Problem
Strong connectivity in directed graphs under failures, with applications
A k-shell decomposition method for weighted networks
Finding critical links for closeness centrality
Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks
Lattices in social networks with influence
Key player policies when contextual effects matter
Selected topics in critical element detection
Identifying a set of key members in social networks using SDP-based stochastic search and integer programming algorithms
Complexity of the critical node problem over trees
Critical node/edge detection problems on trees
The firebreak problem
On the distance between random events on a network
Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures
Detection of key figures in social networks by combining harmonic modularity with community structure-regulated network embedding
Axiomatic characterization of PageRank
Finding the most degree-central walks and paths in a graph: exact and heuristic approaches
Gendered networks and communicability in medieval historical narratives
The general ownership structure of the European aerospace industry a statistical and network analysis
A comparison of centrality measures and their role in controlling the spread in epidemic networks
Analysis of network interventions with an application to hospital-acquired infections
A survey on optimization studies of group centrality metrics
Targeting in adaptive networks
The k-way vertex cut problem on bipartite graphs: complexity results and algorithms
Density-based clustering of social networks
Key leaders in social networks

This page was built for publication: Identifying sets of key players in a social network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q159769)