A survey on optimization studies of group centrality metrics

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Identifying sets of key players in a social network
An index to quantify an individual's scientific research output
Algorithms for the maximum \(k\)-club problem in graphs
An exact algorithm for the maximum probabilistic clique problem
Finding clique clusters with the highest betweenness centrality
The \(p\)-median problem: a survey of metaheuristic approaches
Incremental deployment of network monitors based on Group Betweenness Centrality
The maximum clique problem
Approximation algorithms for connected dominating sets
The critical node detection problem in networks: a survey
The Benders decomposition algorithm: a literature review
Detecting a most closeness-central clique in complex networks
I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs
An integer programming approach for finding the most and the least central cliques
A new status index derived from sociometric analysis
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
Maximum Betweenness Centrality: Approximability and Tractable Cases
Ranking of Closeness Centrality for Large-Scale Social Networks
Routing betweenness centrality
The Maximum Coverage Location Problem
A graph‐theoretic generalization of the clique concept
The centrality of groups and classes
On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches
Integer programming models for detecting graph bipartitions with structural requirements
Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality
The Star Degree Centrality Problem: A Decomposition Approach
Finding Critical Links for Closeness Centrality
Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks
Group Centrality Maximization for Large-scale Graphs
Group-Harmonic and Group-Closeness Maximization – Approximation and Engineering
The Optimal Design of Low-Latency Virtual Backbones
Scaling up Group Closeness Maximization
Selected Topics in Critical Element Detection
Finding groups with maximum betweenness centrality
Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
STACS 2005
Paths and flows for centrality measures in networks
Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures
The stochastic pseudo-star degree centrality problem
Finding the most degree-central walks and paths in a graph: exact and heuristic approaches
Finding groups with maximum betweenness centrality via integer programming with random path sampling
Expanding students' social networks via optimized team assignments

This page was built for publication: A survey on optimization studies of group centrality metrics

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