On robust clusters of minimum cardinality in networks (Q513606): Difference between revisions

@@ Property / author @@
-Sergiy I. Butenko
@@ Property / author: Sergiy I. Butenko / rank @@
-Normal rank
@@ Property / author @@
+Sergiy I. Butenko
@@ Property / author: Sergiy I. Butenko / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+XPRESS
@@ Property / describes a project that uses: XPRESS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10479-015-1992-4
+Normal rank
@@ Property / OpenAlex ID @@
+W1776854177
@@ Property / OpenAlex ID: W1776854177 / rank @@
+Normal rank
@@ Property / cites work @@
+Some APX-completeness results for cubic graphs
@@ Property / cites work: Some APX-completeness results for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximability of some degree-constrained subgraph problems
+Normal rank
@@ Property / cites work @@
+Novel approaches for analyzing biological networks
+Normal rank
@@ Property / cites work @@
+Critically n-Connected Graphs
@@ Property / cites work: Critically n-Connected Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the fault-tolerant diameter and wide diameter of ?-connected graphs
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+k-Blocks and Ultrablocks in Graphs
@@ Property / cites work: k-Blocks and Ultrablocks in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3267900
@@ Property / cites work: Q3267900 / rank @@
+Normal rank
@@ Property / cites work @@
+Property <i>P</i><sub><i>d</i>,<i>m</i></sub> and efficient design of reliable networks
+Normal rank
@@ Property / cites work @@
+Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
+Normal rank
@@ Property / cites work @@
+Robustness and Strong Attack Tolerance of Low-Diameter Networks
+Normal rank
@@ Property / cites work @@
+Parallel Complexity of the Connected Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Generalized diameters and Rabin numbers of networks
+Normal rank
@@ Property / cites work @@
+Hardness of \(k\)-vertex-connected subgraph augmentation problem
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+On clique relaxation models in network analysis
@@ Property / cites work: On clique relaxation models in network analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Finding maximum subgraphs with relatively large vertex connectivity
+Normal rank
@@ Property / cites work @@
+Q4527015
@@ Property / cites work: Q4527015 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
+Normal rank