On robust clusters of minimum cardinality in networks
type: Item
instance of: scholarly article
title: On robust clusters of minimum cardinality in networks
zbMATH Open document ID: 1357.90163
author: Chitra Balasubramaniam
author: Sergiy Butenko
published in: Annals of Operations Research
publication date: 2017-03-07T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6692546
zbMATH Keywords: clique relaxations
zbMATH Keywords: connectivity
zbMATH Keywords: \(k\)-block
zbMATH Keywords: \(k\)-robust \(s\)-club
zbMATH Keywords: structural cohesion
describes a project that uses: DIMACS
describes a project that uses: XPRESS
MaRDI profile type: Publication
full work available at URL: s10479-015-1992-4
OpenAlex ID: W1776854177
cites work: Some APX-completeness results for cubic graphs
cites work: On the approximability of some degree-constrained subgraph problems
cites work: Novel approaches for analyzing biological networks
cites work: Critically n-Connected Graphs
cites work: On the fault-tolerant diameter and wide diameter of ?-connected graphs
cites work: Q3577833
cites work: k-Blocks and Ultrablocks in Graphs
cites work: Q3267900
cites work: Property Pd,m and efficient design of reliable networks
cites work: Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
cites work: Robustness and Strong Attack Tolerance of Low-Diameter Networks
cites work: Parallel Complexity of the Connected Subgraph Problem
cites work: Generalized diameters and Rabin numbers of networks
cites work: Hardness of \(k\)-vertex-connected subgraph augmentation problem
cites work: Optimization, approximation, and complexity classes
cites work: On clique relaxation models in network analysis
cites work: Finding maximum subgraphs with relatively large vertex connectivity
cites work: Q4527015
cites work: Q4782696
cites work: Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
DOI: 10.1007/S10479-015-1992-4
Recommended article: Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
Recommended article: Q5379104
Recommended article: Statistical Clustering of a Random Network by Extremal Properties
Recommended article: Robustness of interdependent and interconnected clustered networks
Recommended article: On the statistical detection of clusters in undirected networks
Recommended article: Measuring the robustness of a network using minimal vertex covers
Recommended article: An application of the minimal spanning tree approach to the cluster stability problem
Recommended article: Clustering powers of sparse graphs
Recommended article: Q3370779
description: scientific article; zbMATH DE number 6692546