On the power of tree-depth for fully polynomial FPT algorithms (Q3304140)
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 7228432
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the power of tree-depth for fully polynomial FPT algorithms |
scientific article; zbMATH DE number 7228432 |
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
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (English)
0 references
0.7884960174560547
0 references
0.7649783492088318
0 references
0.7625636458396912
0 references
0.7593504786491394
0 references
