Detecting a most closeness-central clique in complex networks
From MaRDI portal
Publication:2286965
DOI10.1016/j.ejor.2019.11.035zbMath1431.90165OpenAlexW2991543458MaRDI QIDQ2286965
Balabhaskar Balasundaram, Foad Mahdavi Pajouh, Farzaneh Nasirian
Publication date: 23 January 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.11.035
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (6)
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 ⋮ Finding the most degree-central walks and paths in a graph: exact and heuristic approaches ⋮ Energy disruptive centrality with an application to criminal network ⋮ Incentive rate determination in viral marketing
Cites Work
- Unnamed Item
- Unnamed Item
- A branch and cut solver for the maximum stable set problem
- Laplacian centrality: A new centrality measure for weighted networks
- Finding clique clusters with the highest betweenness centrality
- The maximum clique problem
- Exact algorithms for the minimum cost vertex blocker clique problem
- I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs
- An integer programming approach for finding the most and the least central cliques
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem
- Clique-detection models in computational biochemistry and genomics
- Mining market data: a network approach
- Graph Theory for Systems Biology
- Statistical mechanics of complex networks
- The centrality of groups and classes
- Reducibility among Combinatorial Problems
- Finding Critical Links for Closeness Centrality
- Finding groups with maximum betweenness centrality
- Collective dynamics of ‘small-world’ networks
This page was built for publication: Detecting a most closeness-central clique in complex networks
