Finding good approximate vertex and edge partitions is NP-hard (Q1198051): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning Planar Graphs
@@ Property / cites work: Partitioning Planar Graphs / rank @@
+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 @@
+An Efficient Heuristic Procedure for Partitioning Graphs
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Heuristic Algorithm for Small Separators in Arbitrary Graphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1198051