Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width |
scientific article |
Statements
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (English)
0 references
15 June 2012
0 references
