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