Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398)
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 7765761
| 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 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
0.9961968660354614
0 references
0.9090354442596436
0 references
0.8709604740142822
0 references
