Most balanced minimum cuts (Q968139): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2009.09.010
@@ Property / DOI: 10.1016/j.dam.2009.09.010 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2009.09.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2047642894
@@ Property / OpenAlex ID: W2047642894 / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating Multicut and Sparsest-Cut
+Normal rank
@@ Property / cites work @@
+On the Minimum Cut of Planarizations
@@ Property / cites work: On the Minimum Cut of Planarizations / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness of cut problems in directed graphs
@@ Property / cites work: Hardness of cut problems in directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding small balanced separators
@@ Property / cites work: Finding small balanced separators / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of finding balanced oneway cuts
@@ Property / cites work: On the complexity of finding balanced oneway cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition algorithms for orders of small width and graphs of small Dilworth number
+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 @@
+Q5514188
@@ Property / cites work: Q5514188 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
+Normal rank
@@ Property / cites work @@
+Q3140397
@@ Property / cites work: Q3140397 / rank @@
+Normal rank
@@ Property / cites work @@
+Partially ordered knapsack and applications to scheduling
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+On the structure of all minimum cuts in a network and applications
+Normal rank
@@ Property / cites work @@
+Suboptimal cuts: Their enumeration, weight and number
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2009.09.010
@@ Property / DOI: 10.1016/J.DAM.2009.09.010 / rank @@
+Normal rank