On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Power of Tree-Depth for Fully Polynomial FPT Algorithms |
scientific article |
Statements
5 August 2020
0 references
fully polynomial FPT algorithm
0 references
tree-depth
0 references
divide-and-conquer
0 references
0 references
0 references
0 references
0 references
0 references
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (English)
0 references
