Strength and reinforcement of a network and tree packing (Q4007379): Difference between revisions

@@ 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 @@
+Connectivity and edge-disjoint spanning trees
@@ Property / cites work: Connectivity and edge-disjoint spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum partition of a matroid into independent subsets
+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 @@
+A decomposition of a graph into dense subgraphs
@@ Property / cites work: A decomposition of a graph into dense subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum cuts, modular functions, and matroid polyhedra
+Normal rank