Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q234411 |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 01:08, 5 March 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