On the parameterized complexity of the repetition free longest common subsequence problem (Q413298): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q15
@@ Property / Mathematics Subject Classification ID: 68Q15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R05
@@ Property / Mathematics Subject Classification ID: 68R05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+D20
@@ Property / Mathematics Subject Classification ID: 92D20 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6030966
@@ Property / zbMATH DE Number: 6030966 / 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
@@ Property / zbMATH Keywords @@
+repetition free longest common subsequence
@@ Property / zbMATH Keywords: repetition free longest common subsequence / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+longest common subsequence
@@ Property / zbMATH Keywords: longest common subsequence / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+parameterized complexity
@@ Property / zbMATH Keywords: parameterized complexity / rank @@
+Normal rank

Revision as of 20:03, 29 June 2023