Fine-grained parameterized complexity analysis of knot-free vertex deletion -- a deadlock resolution graph problem (Q1790957)
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: Fine-grained parameterized complexity analysis of knot-free vertex deletion -- a deadlock resolution graph problem |
scientific article; zbMATH DE number 6946779
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fine-grained parameterized complexity analysis of knot-free vertex deletion -- a deadlock resolution graph problem |
scientific article; zbMATH DE number 6946779 |
Statements
Fine-grained parameterized complexity analysis of knot-free vertex deletion -- a deadlock resolution graph problem (English)
0 references
4 October 2018
0 references
knot
0 references
deadlock resolution
0 references
FPT
0 references
W[1]-hardness
0 references
ETH
0 references
0.7614521384239197
0 references
0.7399322390556335
0 references
0.7156439423561096
0 references
0.7123429179191589
0 references
0.7109827399253845
0 references
