Strength of a graph and packing of trees and branchings (Q1895050): Difference between revisions

@@ Property / cites work @@
+Connectivity and edge-disjoint spanning trees
@@ Property / cites work: Connectivity and edge-disjoint spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal attack and reinforcement of a network
@@ Property / cites work: Optimal attack and reinforcement of a network / rank @@
+Normal rank
@@ Property / cites work @@
+Q4695811
@@ Property / cites work: Q4695811 / rank @@
+Normal rank
@@ Property / cites work @@
+Fractional covers for forests and matchings
@@ Property / cites work: Fractional covers for forests and matchings / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+Normal rank
@@ Property / cites work @@
+Computing the Strength of a Graph
@@ Property / cites work: Computing the Strength of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to the maximum-flow problem
@@ Property / cites work: A new approach to the maximum-flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+Testing membership in matroid polyhedra
@@ Property / cites work: Testing membership in matroid polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Packing and covering with integral feasible flows in integral supply-demand networks
+Normal rank