Constrained multilinear detection for faster functional motif discovery (Q456168): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Upper and lower bounds for finding connected motifs in vertex-colored graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding and Counting Vertex-Colored Subtrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Faster Algebraic Algorithms for Path and Packing Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding paths of length \(k\) in \(O^{*}(2^k)\) time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Limits and Applications of Group Algebras for Parameterized Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity issues in vertex-colored graph pattern matching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding Approximate and Constrained Motifs in Graphs / rank | |||
Normal rank |
Latest revision as of 20:02, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Constrained multilinear detection for faster functional motif discovery |
scientific article |
Statements
Constrained multilinear detection for faster functional motif discovery (English)
0 references
23 October 2012
0 references
graph algorithms
0 references
randomized algorithms
0 references
parameterized algorithms
0 references