On robust clusters of minimum cardinality in networks

DOI10.1007/s10479-015-1992-4zbMath1357.90163OpenAlexW1776854177MaRDI QIDQ513606

Chitra Balasubramaniam, Sergiy I. Butenko

Publication date: 7 March 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-015-1992-4

zbMATH Keywords

connectivity\(k\)-blockclique relaxations\(k\)-robust \(s\)-clubstructural cohesion

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11)

Related Items

Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments

Uses Software

• XPRESS
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding maximum subgraphs with relatively large vertex connectivity
• Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
• On the approximability of some degree-constrained subgraph problems
• Hardness of \(k\)-vertex-connected subgraph augmentation problem
• Optimization, approximation, and complexity classes
• k-Blocks and Ultrablocks in Graphs
• Generalized diameters and Rabin numbers of networks
• Some APX-completeness results for cubic graphs
• On clique relaxation models in network analysis
• Novel approaches for analyzing biological networks
• Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
• Parallel Complexity of the Connected Subgraph Problem
• On the fault-tolerant diameter and wide diameter of ?-connected graphs
• Property P_d,m and efficient design of reliable networks
• Robustness and Strong Attack Tolerance of Low-Diameter Networks
• Critically n-Connected Graphs