An \(O(EV\log^2V)\) algorithm for the maximal flow problem (Q1147636): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0022-0000(80)90035-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2091084079
@@ Property / OpenAlex ID: W2091084079 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5624995
@@ Property / cites work: Q5624995 / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Q5514188
@@ Property / cites work: Q5514188 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum Flow in Planar Networks
@@ Property / cites work: Maximum Flow in Planar Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4058442
@@ Property / cites work: Q4058442 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(IVI^3)\) algorithm for finding maximum flows in networks
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1147636