Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search (Q3452823): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-662-48350-3_52
+Normal rank
@@ Property / OpenAlex ID @@
+W2294178601
@@ Property / OpenAlex ID: W2294178601 / rank @@
+Normal rank
@@ Property / cites work @@
+A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem
+Normal rank
@@ Property / cites work @@
+On implementing the push-relabel method for the maximum flow problem
+Normal rank
@@ Property / cites work @@
+Better Bounds for Graph Bisection
@@ Property / cites work: Better Bounds for Graph Bisection / 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 @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+Normal rank
@@ Property / cites work @@
+The Partial Augment–Relabel Algorithm for the Maximum Flow Problem
+Normal rank
@@ Property / cites work @@
+Maximum Flows by Incremental Breadth-First Search
@@ Property / cites work: Maximum Flows by Incremental Breadth-First Search / 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 @@
+A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
+Normal rank
@@ Property / cites work @@
+The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
+Normal rank