A new saling algorithm for the maximum mean cut problem (Q1317477): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast and Simple Algorithm for the Maximum Flow Problem
+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 @@
+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 @@
+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 @@
+Finding minimum-cost circulations by canceling negative cycles
+Normal rank
@@ Property / cites work @@
+Q3751390
@@ Property / cites work: Q3751390 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of the minimum cycle mean in a digraph
+Normal rank
@@ Property / cites work @@
+Q2718910
@@ Property / cites work: Q2718910 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5516084
@@ Property / cites work: Q5516084 / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Algorithm for Optimally Increasing the Edge Connectivity
+Normal rank
@@ Property / cites work @@
+New scaling algorithms for the assignment and minimum mean cycle problems
+Normal rank
@@ Property / cites work @@
+A linear time randomizing algorithm for searching ranked functions
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01240735
+Normal rank
@@ Property / OpenAlex ID @@
+W2090219729
@@ Property / OpenAlex ID: W2090219729 / rank @@
+Normal rank