A parametric maximum flow algorithm for bipartite graphs with applications (Q1129980): Difference between revisions

@@ 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 @@
+Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
+Normal rank
@@ Property / cites work @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Bipartite Network Flow
@@ Property / cites work: Fast Algorithms for Bipartite Network Flow / rank @@
+Normal rank
@@ Property / cites work @@
+Some simple scheduling algorithms
@@ Property / cites work: Some simple scheduling algorithms / 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 @@
+Scheduling with Deadlines and Loss Functions
@@ Property / cites work: Scheduling with Deadlines and Loss Functions / rank @@
+Normal rank
@@ Property / cites work @@
+A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0377-2217(93)e0161-p
+Normal rank
@@ Property / OpenAlex ID @@
+W2046931398
@@ Property / OpenAlex ID: W2046931398 / rank @@
+Normal rank