Constrained multilinear detection for faster functional motif discovery (Q456168): Difference between revisions

@@ Property / OpenAlex ID @@
+W2013902279
@@ Property / OpenAlex ID: W2013902279 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.3483
@@ Property / arXiv ID: 1206.3483 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper and lower bounds for finding connected motifs in vertex-colored graphs
+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 @@
+Faster Algebraic Algorithms for Path and Packing Problems
+Normal rank
@@ Property / cites work @@
+Finding paths of length \(k\) in \(O^{*}(2^k)\) time
+Normal rank
@@ Property / cites work @@
+Limits and Applications of Group Algebras for Parameterized Problems
+Normal rank
@@ Property / cites work @@
+Complexity issues in vertex-colored graph pattern matching
+Normal rank
@@ Property / cites work @@
+Finding Approximate and Constrained Motifs in Graphs
+Normal rank