A new Karzanov-type \(O(n^ 3)\) max-flow algorithm (Q1197076): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0895-7177(92)90007-8
+Normal rank
@@ Property / OpenAlex ID @@
+W1994891541
@@ Property / OpenAlex ID: W1994891541 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4058442
@@ Property / cites work: Q4058442 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple version of Karzanov's blocking flow algorithm
+Normal rank
@@ Property / cites work @@
+Q5624995
@@ Property / cites work: Q5624995 / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple Algorithm for Finding Maximal Network Flows and an                         Application to the Hitchcock Problem
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+An \(O(IVI^3)\) algorithm for finding maximum flows in networks
+Normal rank
@@ Property / cites work @@
+An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem
+Normal rank
@@ Property / cites work @@
+An \(O(EV\log^2V)\) algorithm for the maximal flow problem
+Normal rank
@@ Property / cites work @@
+An O(n2log n) parallel max-flow algorithm
@@ Property / cites work: An O(n2log n) parallel max-flow algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast and Simple Algorithm for the Maximum Flow Problem
+Normal rank
@@ Property / cites work @@
+Q3707420
@@ Property / cites work: Q3707420 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5514188
@@ Property / cites work: Q5514188 / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of phase and nonphase network flow algorithms
+Normal rank