Finding and counting vertex-colored subtrees (Q1949738): Difference between revisions

@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+On the Kernelization Complexity of Colorful Motifs
+Normal rank
@@ Property / cites work @@
+Q4427867
@@ Property / cites work: Q4427867 / 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 @@
+Maximum Motif Problem in Vertex-Colored Graphs
@@ Property / cites work: Maximum Motif Problem in Vertex-Colored Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of Counting Problems
@@ Property / cites work: The Parameterized Complexity of Counting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Finding and Counting Vertex-Colored Subtrees
@@ Property / cites work: Finding and Counting Vertex-Colored Subtrees / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm engineering for color-coding with applications to signaling pathway detection
+Normal rank
@@ Property / cites work @@
+Dynamic programming meets the principle of inclusion and exclusion
+Normal rank
@@ Property / cites work @@
+Finding paths of length \(k\) in \(O^{*}(2^k)\) time
+Normal rank