Pages that link to "Item:Q4247922"

The following pages link to The centrality of groups and classes (Q4247922):

Displaying 41 items.

• Identifying sets of key players in a social network (Q159769) (← links)
• Core/periphery scientific collaboration networks among very similar researchers (Q430910) (← links)
• Finding clique clusters with the highest betweenness centrality (Q724070) (← links)
• Comments on: ``Static and dynamic source locations in undirected networks'' (Q889102) (← links)
• Efficient algorithms for game-theoretic betweenness centrality (Q899439) (← links)
• A measure for a balanced workload and its extremal values (Q906433) (← links)
• Incremental deployment of network monitors based on Group Betweenness Centrality (Q990953) (← links)
• Potential-based bounded-cost search and anytime non-parametric A* (Q2014923) (← links)
• Spectral density of equitable core-periphery graphs (Q2070211) (← links)
• Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization (Q2112685) (← links)
• Influence measures in subnetworks using vertex centrality (Q2153638) (← links)
• Tournament solutions based on cooperative game theory (Q2178642) (← links)
• A centrality notion for graphs based on Tukey depth (Q2244178) (← links)
• Detecting a most closeness-central clique in complex networks (Q2286965) (← links)
• I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs (Q2293164) (← links)
• On network analysis using non-additive integrals: extending the game-theoretic network centrality (Q2317521) (← links)
• An integer programming approach for finding the most and the least central cliques (Q2341092) (← links)
• Group centralization of network indices (Q2345606) (← links)
• Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence (Q2654152) (← links)
• Structural search and optimization in social networks (Q2815472) (← links)
• Maximum Betweenness Centrality: Approximability and Tractable Cases (Q3078375) (← links)
• Centrality metrics and localization in core-periphery networks (Q3302535) (← links)
• Betweenness Centrality: Extremal Values and Structural Properties (Q3606084) (← links)
• Network Essence: PageRank Completion and Centrality-Conforming Markov Chains (Q4604398) (← links)
• Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
• Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs (Q5025042) (← links)
• The Star Degree Centrality Problem: A Decomposition Approach (Q5084632) (← links)
• Finding Critical Links for Closeness Centrality (Q5138269) (← links)
• Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks (Q5139626) (← links)
• Finding groups with maximum betweenness centrality (Q5268927) (← links)
• Who You Know vs. What You Know: The Impact of Social Position and Knowledge on Team Performance (Q5290832) (← links)
• Identifying a Set of Key Members in Social Networks Using SDP-Based Stochastic Search and Integer Programming Algorithms (Q5348807) (← links)
• Paths and flows for centrality measures in networks (Q6066246) (← links)
• Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures (Q6087561) (← links)
• The stochastic pseudo-star degree centrality problem (Q6112539) (← links)
• Finding the most degree-central walks and paths in a graph: exact and heuristic approaches (Q6167664) (← links)
• Finding groups with maximum betweenness centrality via integer programming with random path sampling (Q6183091) (← links)
• Central industries in the Ecuadorian input-output network. An application of social network analysis (Q6537130) (← links)
• Optimal influence under observational learning (Q6549090) (← links)
• The parameterized complexity of maximum betweenness centrality (Q6636087) (← links)
• A survey on optimization studies of group centrality metrics (Q6659090) (← links)