Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-1-4614-3906-6_7
+Normal rank
@@ Property / OpenAlex ID @@
+W309944
@@ Property / OpenAlex ID: W309944 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3044359
@@ Property / cites work: Q3044359 / rank @@
+Normal rank
@@ Property / cites work @@
+Novel approaches for analyzing biological networks
+Normal rank
@@ Property / cites work @@
+Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem
+Normal rank
@@ Property / cites work @@
+A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
+Normal rank
@@ Property / cites work @@
+The \(k\) edge-disjoint 3-hop-constrained paths polytope
+Normal rank
@@ Property / cites work @@
+Q3145799
@@ Property / cites work: Q3145799 / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum augmentation of any graph to aK-edge-connected graph
+Normal rank
@@ Property / cites work @@
+A new linearization technique for multi-quadratic 0-1 programming problems.
+Normal rank
@@ Property / cites work @@
+On the \(k\) edge-disjoint 2-hop-constrained paths polytope
+Normal rank
@@ Property / cites work @@
+The 2-path network problem
@@ Property / cites work: The 2-path network problem / rank @@
+Normal rank
@@ Property / cites work @@
+Augmentation Problems
@@ Property / cites work: Augmentation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting Graphs to Meet Edge-Connectivity Requirements
+Normal rank
@@ Property / cites work @@
+Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
+Normal rank
@@ Property / cites work @@
+Simpler and faster biconnectivity augmentation
@@ Property / cites work: Simpler and faster biconnectivity augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
+Normal rank
@@ Property / cites work @@
+On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
+Normal rank
@@ Property / cites work @@
+On Critical Graphs of Diameter 2
@@ Property / cites work: On Critical Graphs of Diameter 2 / rank @@
+Normal rank
@@ Property / cites work @@
+A graph‐theoretic generalization of the clique concept
+Normal rank
@@ Property / cites work @@
+An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter
+Normal rank
@@ Property / cites work @@
+Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
+Normal rank
@@ Property / cites work @@
+Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
+Normal rank