Parameterized Algorithms and Hardness Results for Some Graph Motif Problems (Q3506940): Difference between revisions
From MaRDI portal
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