On cutting a few vertices from a graph (Q1811082): Difference between revisions

@@ Property / cites work @@
+Finding good approximate vertex and edge partitions is NP-hard
+Normal rank
@@ Property / cites work @@
+A Polylogarithmic Approximation of the Minimum Bisection
+Normal rank
@@ Property / cites work @@
+Approximating the minimum bisection size (extended abstract)
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / 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 @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank