A new algorithm for solving the feasibility problem of a network flow (Q990544): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.amc.2007.03.038
+Normal rank
@@ Property / OpenAlex ID @@
+W2050503419
@@ Property / OpenAlex ID: W2050503419 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Time Bounds for the Maximum Flow Problem
@@ Property / cites work: Improved Time Bounds for the Maximum Flow Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach for computing a most positive cut using the minimum flow algorithms
+Normal rank
@@ Property / cites work @@
+Beyond the flow decomposition barrier
@@ Property / cites work: Beyond the flow decomposition barrier / 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 @@
+The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm
+Normal rank
@@ Property / cites work @@
+Q3274170
@@ Property / cites work: Q3274170 / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Deterministic Maximum Flow Algorithm
@@ Property / cites work: A Faster Deterministic Maximum Flow Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Computing maximum mean cuts
@@ Property / cites work: Computing maximum mean cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Online load balancing and network flow
@@ Property / cites work: Online load balancing and network flow / rank @@
+Normal rank