Detecting a most closeness-central clique in complex networks

DOI10.1016/J.EJOR.2019.11.035MaRDI QIDQ2286965zbMATH OpenOpenAlexFDO

Authors Farzaneh Nasirian, F. Mahdavi Pajouh, B. Balasundaram

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

zbMATH Keywords

cliquecloseness centralityexact algorithmsnetworksNP-completeness

Mathematics Subject Classification ID

Mixed integer programming (90C11) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• An integer programming approach for finding the most and the least central cliques
• Finding clique clusters with the highest betweenness centrality
• Scaling up group closeness maximization
• Finding critical links for closeness centrality
• Finding groups with maximum betweenness centrality

Cites work

• A branch and cut solver for the maximum stable set problem
• A new branch-and-bound algorithm for the maximum edge-weighted clique problem
• An integer programming approach for finding the most and the least central cliques
• Clique-detection models in computational biochemistry and genomics
• Collective dynamics of `small-world' networks
• Exact algorithms for the minimum cost vertex blocker clique problem
• Finding clique clusters with the highest betweenness centrality
• Finding critical links for closeness centrality
• Finding groups with maximum betweenness centrality
• Graph theory for systems biology: interval graphs, motifs, and pattern recognition
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• I/O-efficient calculation of H-group closeness centrality over disk-resident graphs
• Laplacian centrality: A new centrality measure for weighted networks
• Mining market data: a network approach
• Network flows. Theory, algorithms, and applications.
• Reducibility among combinatorial problems
• Statistical mechanics of complex networks
• The centrality of groups and classes
• The maximum clique problem

Cited in

(12)

• Energy disruptive centrality with an application to criminal network
• Incentive rate determination in viral marketing
• An integer programming approach for finding the most and the least central cliques
• The star degree centrality problem: a decomposition approach
• Finding critical links for closeness centrality
• Scaling up group closeness maximization
• scientific article; zbMATH DE number 5663542 (Why is no real title available?)
• 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
• A survey on optimization studies of group centrality metrics
• Finding clique clusters with the highest betweenness centrality

This page was built for publication: Detecting a most closeness-central clique in complex networks

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