Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C20
@@ Property / Mathematics Subject Classification ID: 05C20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q27
@@ Property / Mathematics Subject Classification ID: 68Q27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W40
@@ Property / Mathematics Subject Classification ID: 68W40 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6244352
@@ Property / zbMATH DE Number: 6244352 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+parameterized algorithms
@@ Property / zbMATH Keywords: parameterized algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+subexponential running time
@@ Property / zbMATH Keywords: subexponential running time / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+directed graph
@@ Property / zbMATH Keywords: directed graph / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph algorithms
@@ Property / zbMATH Keywords: graph algorithms / rank @@
+Normal rank

Revision as of 14:15, 29 June 2023