An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q5363767)
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 6784965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion |
scientific article; zbMATH DE number 6784965 |
Statements
29 September 2017
0 references
(linear) rankwidth
0 references
distance-hereditary graphs
0 references
thread graphs
0 references
parameterized complexity
0 references
kernelization
0 references
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion (English)
0 references
0.9884302616119384
0 references
0.7850330471992493
0 references
0.7780683636665344
0 references
0.7702052593231201
0 references
0.7558467984199524
0 references
