An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6378669
@@ Property / zbMATH DE Number: 6378669 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+directed Steiner tree
@@ Property / zbMATH Keywords: directed Steiner tree / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+parameterized complexity
@@ Property / zbMATH Keywords: parameterized complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+dynamic programming
@@ Property / zbMATH Keywords: dynamic programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+algorithms
@@ Property / zbMATH Keywords: algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorial problems
@@ Property / zbMATH Keywords: combinatorial problems / rank @@
+Normal rank

Revision as of 18:24, 30 June 2023