Finding clique clusters with the highest betweenness centrality
DOI10.1016/J.EJOR.2018.05.006zbMATH Open1403.90646OpenAlexW2799382350WikidataQ129855699 ScholiaQ129855699MaRDI QIDQ724070FDOQ724070
Eduardo L. Pasiliao, F. 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
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
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)
Cites Work
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Title not available (Why is that?)
- Community structure in social and biological networks
- Title not available (Why is that?)
- The maximum clique problem
- Collective dynamics of ‘small-world’ networks
- The centrality of groups and classes
- An integer programming approach for finding the most and the least central cliques
- A branch-and-bound approach for maximum quasi-cliques
- Modeling centrality measures in social network analysis using bi-criteria network flow optimization problems
- Evolution of social networks
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
- Analysis of heuristics for finding a maximum weight planar subgraph
- Finding groups with maximum betweenness centrality
Cited In (9)
- The Star Degree Centrality Problem: A Decomposition Approach
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem
- The maximum clique interdiction problem
- Finding the most degree-central walks and paths in a graph: exact and heuristic approaches
- The stochastic pseudo-star degree centrality problem
- Energy disruptive centrality with an application to criminal network
- 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
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)
