Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:04, 10 July 2024
scientific article; zbMATH DE number 7765761
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of finding a spanning tree with minimum reload cost diameter |
scientific article; zbMATH DE number 7765761 |
Statements
Parameterized complexity of finding a spanning tree with minimum reload cost diameter (English)
0 references
15 November 2023
0 references
dynamic programming
0 references
FPT algorithm
0 references
minimum-diameter spanning tree
0 references
parameterized complexity
0 references
reload-cost problems
0 references
treewidth
0 references
