A faster algorithm for computing the strength of a network (Q1318743): Difference between revisions

@@ Property / author @@
-William H. Cunningham
@@ Property / author: William H. Cunningham / rank @@
-Normal rank
@@ Property / author @@
+William H. Cunningham
@@ Property / author: William H. Cunningham / 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.1016/0020-0190(94)90013-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2043574467
@@ Property / OpenAlex ID: W2043574467 / rank @@
+Normal rank
@@ Property / cites work @@
+Separating from the dominant of the spanning tree polytope
+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 @@
+Q5684698
@@ Property / cites work: Q5684698 / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+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 @@
+Computing the Strength of a Graph
@@ Property / cites work: Computing the Strength of a Graph / rank @@
+Normal rank