Finding clique clusters with the highest betweenness centrality

DOI10.1016/j.ejor.2018.05.006zbMath1403.90646OpenAlexW2799382350MaRDI QIDQ724070

Eduardo L. Pasiliao, Foad Mahdavi Pajouh, Maciej Rysz

Publication date: 25 July 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.05.006

zbMATH Keywords

networksNP-completenesscliquebetweenness centralitycombinatorial branch-and-bound

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

The Star Degree Centrality Problem: A Decomposition Approach ⋮ Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures ⋮ The stochastic pseudo-star degree centrality problem ⋮ A new branch-and-bound algorithm for the maximum edge-weighted clique problem ⋮ Finding the most degree-central walks and paths in a graph: exact and heuristic approaches ⋮ The maximum clique interdiction problem ⋮ Energy disruptive centrality with an application to criminal network ⋮ Detecting a most closeness-central clique in complex networks

Cites Work

• Unnamed Item
• Unnamed Item
• On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
• A branch-and-bound approach for maximum quasi-cliques
• Analysis of heuristics for finding a maximum weight planar subgraph
• A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
• The maximum clique problem
• Modeling centrality measures in social network analysis using bi-criteria network flow optimization problems
• An integer programming approach for finding the most and the least central cliques
• Evolution of social networks
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
• The centrality of groups and classes
• Community structure in social and biological networks
• Finding groups with maximum betweenness centrality
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Finding clique clusters with the highest betweenness centrality