A polynomial sized kernel for tracking paths problem (Q5919306)
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: A polynomial sized kernel for tracking paths problem |
scientific article; zbMATH DE number 7152171
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial sized kernel for tracking paths problem |
scientific article; zbMATH DE number 7152171 |
Statements
A polynomial sized kernel for tracking paths problem (English)
0 references
16 January 2020
0 references
graph
0 references
s-t paths
0 references
tracking paths
0 references
parameterized complexity
0 references
FPT
0 references
kernel
0 references
feedback vertex set
0 references
0.9969837069511414
0 references
0.8452674746513367
0 references
0.8379960656166077
0 references
