Complexity issues in vertex-colored graph pattern matching (Q533412): Difference between revisions

@@ Property / DOI @@
-.1016/j.jda.2010.09.002
@@ Property / DOI: 10.1016/j.jda.2010.09.002 / 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.1016/j.jda.2010.09.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2086133268
@@ Property / OpenAlex ID: W2086133268 / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
+Normal rank
@@ Property / cites work @@
+Fourier meets M\"{o}bius: fast subset convolution
@@ Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results on restricted instances of a paint shop problem for words
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum Motif Problem in Vertex-Colored Graphs
@@ Property / cites work: Maximum Motif Problem in Vertex-Colored Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
+Normal rank
@@ Property / cites work @@
+Analogs &amp; duals of the MAST problem for sequences &amp; trees
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity and Approximability of the SLCS Problem
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of comparing evolutionary trees
@@ Property / cites work: On the complexity of comparing evolutionary trees / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results on a paint shop problem.
@@ Property / cites work: Complexity results on a paint shop problem. / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm engineering for color-coding with applications to signaling pathway detection
+Normal rank
@@ Property / cites work @@
+On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
+Normal rank
@@ Property / cites work @@
+Research in Computational Molecular Biology
@@ Property / cites work: Research in Computational Molecular Biology / rank @@
+Normal rank
@@ Property / cites work @@
+An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Non deterministic polynomial optimization problems and their approximations
+Normal rank
@@ Property / cites work @@
+Q4527015
@@ Property / cites work: Q4527015 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JDA.2010.09.002
@@ Property / DOI: 10.1016/J.JDA.2010.09.002 / rank @@
+Normal rank