MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs (Q884483): Difference between revisions

@@ Property / cites work @@
+Unit disk graph recognition is NP-hard
@@ Property / cites work: Unit disk graph recognition is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4500843
@@ Property / cites work: Q4500843 / rank @@
+Normal rank
@@ Property / cites work @@
+Unit disk graphs
@@ Property / cites work: Unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Layout Problems on Random Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Cut of a Planar Graph in Polynomial Time
+Normal rank
@@ Property / cites work @@
+NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Better Approximation Schemes for Disk Graphs
@@ Property / cites work: Better Approximation Schemes for Disk Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5659589
@@ Property / cites work: Q5659589 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient graph representations
@@ Property / cites work: Efficient graph representations / rank @@
+Normal rank
@@ Property / cites work @@
+Node-and edge-deletion NP-complete problems
@@ Property / cites work: Node-and edge-deletion NP-complete problems / rank @@
+Normal rank