On the parameterized complexity of computing balanced partitions in graphs (Q493645): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6478529
@@ Property / zbMATH DE Number: 6478529 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bisection
@@ Property / zbMATH Keywords: bisection / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+NP-hard problems
@@ Property / zbMATH Keywords: NP-hard problems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+problem kernelization
@@ Property / zbMATH Keywords: problem kernelization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+cliquewidth
@@ Property / zbMATH Keywords: cliquewidth / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+treewidth reduction
@@ Property / zbMATH Keywords: treewidth reduction / rank @@
+Normal rank

Revision as of 22:25, 30 June 2023