Finding groups with maximum betweenness centrality
DOI10.1080/10556788.2016.1167892zbMATH Open1365.05269OpenAlexW2346326891MaRDI QIDQ5268927FDOQ5268927
Oleg A. Prokopyev, Eduardo L. Pasiliao, Alexander Veremyev
Publication date: 21 June 2017
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2016.1167892
Recommendations
mixed integer programmingbetweenness centralitybounded-distance betweenness centralitygroup betweenness centralitymost central groups
Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Integer programming (90C10)
Cites Work
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Community structure in social and biological networks
- Collective dynamics of ‘small-world’ networks
- Networks. An introduction.
- The centrality of groups and classes
- A faster algorithm for betweenness centrality*
- Title not available (Why is that?)
- On the maximum quasi-clique problem
- On clique relaxation models in network analysis
- An integer programming approach for finding the most and the least central cliques
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- Social and economic networks.
- Finding maximum subgraphs with relatively large vertex connectivity
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- Maximum Betweenness Centrality: Approximability and Tractable Cases
- Incremental deployment of network monitors based on Group Betweenness Centrality
Cited In (10)
- The Star Degree Centrality Problem: A Decomposition Approach
- Finding the most degree-central walks and paths in a graph: exact and heuristic approaches
- Title not available (Why is that?)
- Finding clique clusters with the highest betweenness centrality
- Finding groups with maximum betweenness centrality via integer programming with random path sampling
- On exact solution approaches for the longest induced path problem
- Detecting a most closeness-central clique in complex networks
- A survey on optimization studies of group centrality metrics
- Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures
- Faster computation of successive bounds on the group betweenness centrality
Uses Software
This page was built for publication: Finding groups with maximum betweenness centrality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268927)
