Editing graphs to satisfy degree constraints: a parameterized approach (Q414866): 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 / zbMATH DE Number @@
+6033487
@@ Property / zbMATH DE Number: 6033487 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+parameterized complexity
@@ Property / zbMATH Keywords: parameterized complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexity
@@ Property / zbMATH Keywords: computational complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+kernelization
@@ Property / zbMATH Keywords: kernelization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph editing
@@ Property / zbMATH Keywords: graph editing / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+regular subgraph
@@ Property / zbMATH Keywords: regular subgraph / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+general factor
@@ Property / zbMATH Keywords: general factor / rank @@
+Normal rank

Revision as of 20:24, 29 June 2023