Blocking optimal structures (Q1752656): Difference between revisions

@@ Property / cites work @@
+Multicriteria global minimum cuts
@@ Property / cites work: Multicriteria global minimum cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Blocking unions of arborescences
@@ Property / cites work: Blocking unions of arborescences / rank @@
+Normal rank
@@ Property / cites work @@
+Blocking optimal arborescences
@@ Property / cites work: Blocking optimal arborescences / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness and approximation for network flow interdiction
+Normal rank
@@ Property / cites work @@
+Minimum \(d\)-blockers and \(d\)-transversals in graphs
+Normal rank
@@ Property / cites work @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4744300
@@ Property / cites work: Q4744300 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3085455
@@ Property / cites work: Q3085455 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing girth and cogirth in perturbed graphic matroids
+Normal rank
@@ Property / cites work @@
+Q3455036
@@ Property / cites work: Q3455036 / rank @@
+Normal rank
@@ Property / cites work @@
+On short paths interdiction problems: Total and node-wise limited interdiction
+Normal rank
@@ Property / cites work @@
+Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank
@@ Property / cites work @@
+The intractability of computing the minimum distance of a code
+Normal rank
@@ Property / cites work @@
+Disjoint (<i>s, t</i>)‐cuts in a network
@@ Property / cites work: Disjoint (<i>s, t</i>)‐cuts in a network / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity interdiction
@@ Property / cites work: Connectivity interdiction / rank @@
+Normal rank