Kernelization and parameterized algorithms for covering a tree by a set of stars or paths (Q897955)
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 6517482
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Kernelization and parameterized algorithms for covering a tree by a set of stars or paths |
scientific article; zbMATH DE number 6517482 |
Statements
Kernelization and parameterized algorithms for covering a tree by a set of stars or paths (English)
0 references
8 December 2015
0 references
fixed-parameter tractable
0 references
graph covering
0 references
graph packing
0 references
0 references
0 references
0.9255195260047911
0 references
0.779831051826477
0 references
0.7788037061691284
0 references
0.7782794237136841
0 references
0.7717809677124023
0 references
