On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem |
scientific article; zbMATH DE number 7482358
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem |
scientific article; zbMATH DE number 7482358 |
Statements
On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (English)
0 references
1 March 2022
0 references
knot
0 references
deadlock resolution
0 references
FPT
0 references
W[1]-hard
0 references
ETH
0 references
0 references
0.9949295
0 references
0.88874054
0 references
0.88092774
0 references
0.86545026
0 references
0.86052454
0 references
0.86052436
0 references
0.85624933
0 references
0.85624933
0 references
0.85478354
0 references
