Parameterized Algorithms and Hardness Results for Some Graph Motif Problems (Q3506940): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57359911, #quickstatements; #temporary_batch_1706298242642 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:58, 4 February 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
