Decomposition algorithms for locating minimal cuts in a network (Q3931039): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4673630
@@ Property / cites work: Q4673630 / 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 @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-Terminal Network Flows
@@ Property / cites work: Multi-Terminal Network Flows / rank @@
+Normal rank
@@ Property / cites work @@
+Q5595961
@@ Property / cites work: Q5595961 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal disconnecting sets in directed multi‐commodity networks
+Normal rank
@@ Property / cites work @@
+Optimum Network Partitioning
@@ Property / cites work: Optimum Network Partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+Q4058442
@@ Property / cites work: Q4058442 / rank @@
+Normal rank
@@ Property / cites work @@
+Flow Switching Approach to the Maximum Flow Problem: I
+Normal rank
@@ Property / cites work @@
+An \(O(IVI^3)\) algorithm for finding maximum flows in networks
+Normal rank
@@ Property / cites work @@
+A decomposition algorithm for optimality problems in tree-structured networks
+Normal rank
@@ Property / cites work @@
+Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows
+Normal rank
@@ Property / cites work @@
+More pathological examples for network flow problems
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01581046
+Normal rank
@@ Property / OpenAlex ID @@
+W2014488609
@@ Property / OpenAlex ID: W2014488609 / rank @@
+Normal rank