Parameterized Algorithms and Hardness Results for Some Graph Motif Problems (Q3506940)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5289272
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized Algorithms and Hardness Results for Some Graph Motif Problems |
scientific article; zbMATH DE number 5289272 |
Statements
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems (English)
0 references
17 June 2008
0 references
0 references
0.8789466619491577
0 references
0.8590952754020691
0 references
0.856910228729248
0 references
0.847403347492218
0 references
0.8418703675270081
0 references
