Finding groups with maximum betweenness centrality

DOI10.1080/10556788.2016.1167892MaRDI QIDQ5268927zbMATHOpenAlexFDO

Authors Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao

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

zbMATH Keywords

mixed integer programmingbetweenness centralitybounded-distance betweenness centralitygroup betweenness centralitymost central groups

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Integer programming (90C10)

Recommendations

• Finding clique clusters with the highest betweenness centrality
• An integer programming approach for finding the most and the least central cliques
• scientific article; zbMATH DE number 5663542
• The centrality of groups and classes
• Scaling up group closeness maximization

Cites work

• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• A faster algorithm for betweenness centrality*
• An integer programming approach for finding the most and the least central cliques
• Clique relaxations in social network analysis: the maximum \(k\)-plex problem
• Collective dynamics of `small-world' networks
• Community structure in social and biological networks
• Emergence of Scaling in Random Networks
• Finding maximum subgraphs with relatively large vertex connectivity
• Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
• Incremental deployment of network monitors based on Group Betweenness Centrality
• Maximum betweenness centrality: approximability and tractable cases
• Networks. An introduction.
• On clique relaxation models in network analysis
• On the maximum quasi-clique problem
• Social and economic networks.
• Statistical mechanics of complex networks
• The centrality of groups and classes

Cited in

(13)

• Finding the most degree-central walks and paths in a graph: exact and heuristic approaches
• Group centralization of network indices
• Faster computation of successive bounds on the group betweenness centrality
• Finding groups with maximum betweenness centrality via integer programming with random path sampling
• A survey on optimization studies of group centrality metrics
• On exact solution approaches for the longest induced path problem
• Detecting a most closeness-central clique in complex networks
• scientific article; zbMATH DE number 5663542 (Why is no real title available?)
• An integer programming approach for finding the most and the least central cliques
• Finding critical links for closeness centrality
• Finding clique clusters with the highest betweenness centrality
• The star degree centrality problem: a decomposition approach
• Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures

Describes a project that uses

Uses Software

• Pajek datasets
• SparseMatrix
• XPRESS
• DIMACS

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)