The generalized definitions of the two-dimensional largest common substructure problems (Q2182100): Difference between revisions

@@ Property / describes a project that uses @@
+RTED
@@ Property / describes a project that uses: RTED / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+TED
@@ Property / describes a project that uses: TED / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-020-00685-8
+Normal rank
@@ Property / OpenAlex ID @@
+W3006330111
@@ Property / OpenAlex ID: W3006330111 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity and approximability of finding maximum feasible subsystems of linear relations
+Normal rank
@@ Property / cites work @@
+Generalized LCS
@@ Property / cites work: Generalized LCS / rank @@
+Normal rank
@@ Property / cites work @@
+A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4218435
@@ Property / cites work: Q4218435 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Completeness in approximation classes
@@ Property / cites work: Completeness in approximation classes / rank @@
+Normal rank
@@ Property / cites work @@
+A short note on the approximability of the maximum leaves spanning tree problem
+Normal rank
@@ Property / cites work @@
+Computational complexity of similarity retrieval in a pictorial database
+Normal rank
@@ Property / cites work @@
+A linear space algorithm for computing maximal common subsequences
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding interleaving relationship between sequences
+Normal rank
@@ Property / cites work @@
+Dynamic programming algorithms for the mosaic longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+A fast algorithm for computing longest common subsequences
+Normal rank
@@ Property / cites work @@
+Algorithms for computing variants of the longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+Introduction to the theory of complexity and approximation algorithms
+Normal rank
@@ Property / cites work @@
+Maximum bounded 3-dimensional matching is MAX SNP-complete
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Pattern Matching in Strings
@@ Property / cites work: Fast Pattern Matching in Strings / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2182100