Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q5111862)
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: Parameterized complexity of finding a spanning tree with minimum reload cost diameter |
scientific article; zbMATH DE number 7205187
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of finding a spanning tree with minimum reload cost diameter |
scientific article; zbMATH DE number 7205187 |
Statements
27 May 2020
0 references
reload-cost problems
0 references
minimum-diameter spanning tree
0 references
parameterized complexity
0 references
FPT algorithm
0 references
treewidth
0 references
dynamic programming
0 references
0.9167671799659728
0 references
0.8780322074890137
0 references
0.8780322074890137
0 references
0.8659915328025818
0 references
