Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791)
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 6243129
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight complexity bounds for FPT subgraph problems parameterized by the clique-width |
scientific article; zbMATH DE number 6243129 |
Statements
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (English)
0 references
7 January 2014
0 references
parameterized complexity
0 references
clique-width
0 references
exponential time hypothesis
0 references
0 references
0 references
0.9958340525627136
0 references
0.8162596821784973
0 references
0.8156070709228516
0 references
0.7964693903923035
0 references
0.7932845950126648
0 references
