Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q126568023, #quickstatements; #temporary_batch_1722802475495 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126568023 / rank | |||
Normal rank | |||
Latest revision as of 22:22, 4 August 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
