Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:18, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight complexity bounds for FPT subgraph problems parameterized by the clique-width |
scientific article |
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
