An integer programming approach for finding the most and the least central cliques

DOI10.1007/S11590-014-0782-2zbMath1320.90050OpenAlexW2051477098MaRDI QIDQ2341092

Chrysafis Vogiatzis, Alexander Veremyev, Panos M. Pardalos, Eduardo L. Pasiliao

Publication date: 23 April 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0782-2

zbMATH Keywords

cliquegroup centralityinteger formulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items (12)

Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs ⋮ A variable neighborhood search heuristic for the maximum ratio clique problem ⋮ The Star Degree Centrality Problem: A Decomposition Approach ⋮ An opposition-based memetic algorithm for the maximum quasi-clique problem ⋮ Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures ⋮ Finding the most degree-central walks and paths in a graph: exact and heuristic approaches ⋮ Finding Critical Links for Closeness Centrality ⋮ Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks ⋮ Graph signatures: identification and optimization ⋮ Finding clique clusters with the highest betweenness centrality ⋮ Detecting a most closeness-central clique in complex networks ⋮ Finding groups with maximum betweenness centrality

Uses Software

• Unnamed Item
• SparseMatrix
• DIMACS
• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Path Laplacian matrices: introduction and application to the analysis of consensus in networks
• Incremental deployment of network monitors based on Group Betweenness Centrality
• The power grid as a complex network: a survey
• On clique relaxation models in network analysis
• Clique-detection models in computational biochemistry and genomics
• Mining market data: a network approach
• The centrality index of a graph
• The university of Florida sparse matrix collection
• Statistical mechanics of complex networks
• Maximum Betweenness Centrality: Approximability and Tractable Cases
• The centrality of groups and classes
• Axioms for Centrality
• Network Analysis

This page was built for publication: An integer programming approach for finding the most and the least central cliques