Parameterized Algorithms and Hardness Results for Some Graph Motif Problems (Q3506940): Difference between revisions

@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+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 @@
+Perfect Code is \(W[1]\)-complete
@@ Property / cites work: Perfect Code is \(W[1]\)-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
+Normal rank
@@ Property / cites work @@
+Algorithm engineering for color-coding with applications to signaling pathway detection
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank