On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| label / en | label / en | ||
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPIcs.STACS.2018.41 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963360194 / rank | |||
Normal rank | |||
| Property / title | |||
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (English) | |||
| Property / title: On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (English) / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.STACS.2018.41 / rank | |||
Normal rank | |||
Latest revision as of 01:33, 21 December 2024
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
