Parameterized Algorithms and Hardness Results for Some Graph Motif Problems (Q3506940): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Color-coding / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Perfect Code is \(W[1]\)-complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4503944 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithm engineering for color-coding with applications to signaling pathway detection / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5710169 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank |
Latest revision as of 12:10, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Parameterized Algorithms and Hardness Results for Some Graph Motif Problems |
scientific article |
Statements
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems (English)
0 references
17 June 2008
0 references
0 references