Finding clique clusters with the highest betweenness centrality

DOI10.1016/J.EJOR.2018.05.006MaRDI QIDQ724070zbMATH OpenOpenAlexWikidataFDO

Authors Maciej Rysz, F. Mahdavi Pajouh, Eduardo L. Pasiliao

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) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Detecting a most closeness-central clique in complex networks
• Finding groups with maximum betweenness centrality
• An integer programming approach for finding the most and the least central cliques
• Finding cliques using few probes
• Cluster Identification in Nearest-Neighbor Graphs
• Clustering to Given Connectivities
• Detecting cliques in CONGEST networks
• Detecting cliques in CONGEST networks
• Finding critical links for closeness centrality
• On Finding Graph Clusterings with Maximum Modularity

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• A branch-and-bound approach for maximum quasi-cliques
• A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
• A simple and faster branch-and-bound algorithm for finding a maximum clique
• An integer programming approach for finding the most and the least central cliques
• Analysis of heuristics for finding a maximum weight planar subgraph
• Collective dynamics of `small-world' networks
• Community structure in social and biological networks
• Emergence of Scaling in Random Networks
• Evolution of social networks
• Finding groups with maximum betweenness centrality
• Modeling centrality measures in social network analysis using bi-criteria network flow optimization problems
• Networks, crowds and markets. Reasoning about a highly connected world.
• On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
• Statistical mechanics of complex networks
• The centrality of groups and classes
• The maximum clique problem

Cited in

(13)

• Finding the most degree-central walks and paths in a graph: exact and heuristic approaches
• A new branch-and-bound algorithm for the maximum edge-weighted clique problem
• Finding groups with maximum betweenness centrality via integer programming with random path sampling
• A survey on optimization studies of group centrality metrics
• Structural search and optimization in social networks
• Energy disruptive centrality with an application to criminal network
• Detecting a most closeness-central clique in complex networks
• An integer programming approach for finding the most and the least central cliques
• The star degree centrality problem: a decomposition approach
• Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures
• Finding groups with maximum betweenness centrality
• The maximum clique interdiction problem
• The stochastic pseudo-star degree centrality problem

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

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