On the complexity of singly connected vertex deletion (Q2089067)
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 the complexity of singly connected vertex deletion |
scientific article; zbMATH DE number 7597110
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of singly connected vertex deletion |
scientific article; zbMATH DE number 7597110 |
Statements
On the complexity of singly connected vertex deletion (English)
0 references
6 October 2022
0 references
singly connected digraphs
0 references
FPT algorithm
0 references
kernel
0 references
bounded independence number
0 references
tournaments
0 references
local tournaments
0 references
0 references
0 references
0 references
0 references
0.99999976
0 references
0.91191435
0 references
0.91191435
0 references
0.91002715
0 references
0.9023593
0 references
0 references
0 references
0.89513475
0 references
0.8933397
0 references
0.8921907
0 references
