Pages that link to "Item:Q159769"

The following pages link to Identifying sets of key players in a social network (Q159769):

Displaying 50 items.

• Hybrid constructive heuristics for the critical node problem (Q271993) (← links)
• Component-cardinality-constrained critical node problem in graphs (Q299073) (← links)
• Analysis of complex network performance and heuristic node removal strategies (Q312858) (← links)
• A genetic algorithm for a class of critical node problems (Q325485) (← links)
• Network interdiction via a critical disruption path: branch-and-price algorithms (Q336604) (← links)
• Bound and exact methods for assessing link vulnerability in complex networks (Q405658) (← links)
• An integer programming framework for critical elements detection in graphs (Q405684) (← links)
• Identifying stable network structures and sets of key players using a \(W\)-covering perspective (Q459386) (← links)
• Vulnerability and controllability of networks of networks (Q506872) (← links)
• Complexity of the critical node problem over trees (Q547128) (← links)
• Key leaders in social networks (Q894018) (← links)
• Detecting critical nodes in sparse graphs (Q1013394) (← links)
• influenceR (Q1350989) (← links)
• An optimal approach for the critical node problem using semidefinite programming (Q1620469) (← links)
• Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (Q1634769) (← links)
• Least cost influence propagation in (social) networks (Q1650779) (← links)
• Improved formulations for minimum connectivity network interdiction problems (Q1652701) (← links)
• The bi-objective critical node detection problem (Q1681144) (← links)
• Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results (Q1711228) (← links)
• The critical node detection problem in networks: a survey (Q1750314) (← links)
• Tackling information asymmetry in networks: a new entropy-based ranking index (Q1756553) (← links)
• Exact interdiction models and algorithms for disconnecting networks via node deletions (Q1926497) (← links)
• Regularity of dynamic opinion games (Q1995489) (← links)
• Energy disruptive centrality with an application to criminal network (Q2025571) (← links)
• EIA-CNDP: an exact iterative algorithm for critical node detection problem (Q2027003) (← links)
• Identification of node centrality based on Laplacian energy of networks (Q2111639) (← links)
• Compressive sensing of high betweenness centrality nodes in networks (Q2150293) (← links)
• A new method for centrality measurement using generalized fuzzy graphs (Q2163619) (← links)
• Critical node detection problem for complex network in undirected weighted networks (Q2164641) (← links)
• A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality (Q2182332) (← links)
• Optimizing node infiltrations in complex networks by a local search based heuristic (Q2273672) (← links)
• Group centralization of network indices (Q2345606) (← links)
• What distinguish one from its peers in social networks? (Q2435696) (← links)
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (Q2444525) (← links)
• Exact identification of critical nodes in sparse networks via new compact formulations (Q2448196) (← links)
• VNS solutions for the critical node problem (Q2631225) (← links)
• Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688) (← links)
• The connected critical node problem (Q2672625) (← links)
• Identifying Key Nodes in Social Networks Using Multi-Criteria Decision-Making Tools (Q2803991) (← links)
• Structural search and optimization in social networks (Q2815472) (← links)
• Complexity among combinatorial problems from epidemics (Q4608259) (← links)
• Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
• Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696) (← links)
• The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees (Q5012889) (← links)
• Solving the Distance-Based Critical Node Problem (Q5087707) (← links)
• Strong Connectivity in Directed Graphs under Failures, with Applications (Q5123984) (← links)
• A<i>k</i>-shell decomposition method for weighted networks (Q5137692) (← links)
• Finding Critical Links for Closeness Centrality (Q5138269) (← links)
• Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks (Q5139626) (← links)
• Lattices in Social Networks with Influence (Q5245034) (← links)