Tight complexity bounds for FPT subgraph problems parameterized by clique-width (Q2891349)
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 6046508
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight complexity bounds for FPT subgraph problems parameterized by clique-width |
scientific article; zbMATH DE number 6046508 |
Statements
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (English)
0 references
15 June 2012
0 references
0 references
0.9958340525627136
0 references
0.808521032333374
0 references
0.8063888549804688
0 references
0.8057221174240112
0 references
0.788755476474762
0 references
