Efficient algorithms for the problems of enumerating cuts by non-decreasing weights (Q848944): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-009-9284-5
@@ Property / DOI: 10.1007/s00453-009-9284-5 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-009-9284-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2020816761
@@ Property / OpenAlex ID: W2020816761 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+A new and improved algorithm for the 3-cut problem
+Normal rank
@@ Property / cites work @@
+Q5501810
@@ Property / cites work: Q5501810 / rank @@
+Normal rank
@@ Property / cites work @@
+Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
+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 Polynomial Algorithm for the k-cut Problem for Fixed k
+Normal rank
@@ Property / cites work @@
+Multi-Terminal Network Flows
@@ Property / cites work: Multi-Terminal Network Flows / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
+Normal rank
@@ Property / cites work @@
+Practical performance of efficient minimum cut algorithms
+Normal rank
@@ Property / cites work @@
+A divide-and-conquer approach to the minimum \(k\)-way cut problem.
+Normal rank
@@ Property / cites work @@
+A Deterministic Algorithm for Finding All Minimum <i>k</i>‐Way Cuts
+Normal rank
@@ Property / cites work @@
+A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
+Normal rank
@@ Property / cites work @@
+Minimum cuts in near-linear time
@@ Property / cites work: Minimum cuts in near-linear time / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to the minimum cut problem
@@ Property / cites work: A new approach to the minimum cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
+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 @@
+Q4952694
@@ Property / cites work: Q4952694 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
+Normal rank
@@ Property / cites work @@
+A fast algorithm for computing minimum 3-way and 4-way cuts
+Normal rank
@@ Property / cites work @@
+Implementing an efficient minimum capacity cut algorithm
+Normal rank
@@ Property / cites work @@
+Computing All Small Cuts in an Undirected Network
@@ Property / cites work: Computing All Small Cuts in an Undirected Network / rank @@
+Normal rank
@@ Property / cites work @@
+A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
+Normal rank
@@ Property / cites work @@
+On the structure of all minimum cuts in a network and applications
+Normal rank
@@ Property / cites work @@
+Q3549696
@@ Property / cites work: Q3549696 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
+Normal rank
@@ Property / DOI @@
+.1007/S00453-009-9284-5
@@ Property / DOI: 10.1007/S00453-009-9284-5 / rank @@
+Normal rank