Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617)
From MaRDI portal
(Redirected from Item:Q3181058)
| 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 the MinCCA problem on graphs of bounded decomposability |
scientific article; zbMATH DE number 6667990
- Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of the MinCCA problem on graphs of bounded decomposability |
scientific article; zbMATH DE number 6667990 |
|
Statements
Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (English)
0 references
Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability (English)
0 references
24 August 2017
0 references
22 December 2016
0 references
minimum changeover cost arborescence
0 references
parameterized complexity
0 references
FPT algorithm
0 references
treewidth
0 references
tree-cutwidth
0 references
planar graph
0 references
\(\mathsf{FPT}\) algorithm
0 references
dynamic programming
0 references
1.0000001
0 references
0.90015495
0 references
0.90015495
0 references
0.89785296
0 references
0.8906764
0 references