Identifying sets of key players in a social network
From MaRDI portal
Publication:159769
DOI10.1007/s10588-006-7084-xzbMath1198.91180OpenAlexW2111347279MaRDI QIDQ159769
Stephen P. Borgatti, Stephen P. Borgatti
Publication date: April 2006
Published in: Computational and Mathematical Organization Theory, Computational \& Mathematical Organization Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10588-006-7084-x
Related Items (56)
Hybrid constructive heuristics for the critical node problem ⋮ An optimal approach for the critical node problem using semidefinite programming ⋮ Component-cardinality-constrained critical node problem in graphs ⋮ Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem ⋮ VNS solutions for the critical node problem ⋮ Analysis of complex network performance and heuristic node removal strategies ⋮ A genetic algorithm for a class of critical node problems ⋮ Compressive sensing of high betweenness centrality nodes in networks ⋮ Least cost influence propagation in (social) networks ⋮ Network interdiction via a critical disruption path: branch-and-price algorithms ⋮ Improved formulations for minimum connectivity network interdiction problems ⋮ A new method for centrality measurement using generalized fuzzy graphs ⋮ Critical node detection problem for complex network in undirected weighted networks ⋮ Solving the Distance-Based Critical Node Problem ⋮ Efficient methods for the distance-based critical node detection problem in complex networks ⋮ Exact interdiction models and algorithms for disconnecting networks via node deletions ⋮ A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality ⋮ The bi-objective critical node detection problem ⋮ The connected critical node problem ⋮ Identifying a Set of Key Members in Social Networks Using SDP-Based Stochastic Search and Integer Programming Algorithms ⋮ Critical node/edge detection problems on trees ⋮ The firebreak problem ⋮ On the distance between random events on a network ⋮ Bound and exact methods for assessing link vulnerability in complex networks ⋮ An integer programming framework for critical elements detection in graphs ⋮ Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures ⋮ Strong Connectivity in Directed Graphs under Failures, with Applications ⋮ Axiomatic characterization of PageRank ⋮ Finding the most degree-central walks and paths in a graph: exact and heuristic approaches ⋮ Complexity among combinatorial problems from epidemics ⋮ Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results ⋮ Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth ⋮ Identifying stable network structures and sets of key players using a \(W\)-covering perspective ⋮ Exact identification of critical nodes in sparse networks via new compact formulations ⋮ Ak-shell decomposition method for weighted networks ⋮ Finding Critical Links for Closeness Centrality ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks ⋮ Vulnerability and controllability of networks of networks ⋮ Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs ⋮ The critical node detection problem in networks: a survey ⋮ Regularity of dynamic opinion games ⋮ Tackling information asymmetry in networks: a new entropy-based ranking index ⋮ Complexity of the critical node problem over trees ⋮ Optimizing node infiltrations in complex networks by a local search based heuristic ⋮ Energy disruptive centrality with an application to criminal network ⋮ EIA-CNDP: an exact iterative algorithm for critical node detection problem ⋮ Detecting critical nodes in sparse graphs ⋮ Structural Search and Optimization in Social Networks ⋮ Lattices in Social Networks with Influence ⋮ Key Player Policies When Contextual Effects Matter ⋮ The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees ⋮ Selected Topics in Critical Element Detection ⋮ Group centralization of network indices ⋮ influenceR ⋮ Identification of node centrality based on Laplacian energy of networks
Cites Work
This page was built for publication: Identifying sets of key players in a social network
