Parameterized complexity of the MINCCA problem on graphs of bounded decomposability

In an edge-colored graph, the cost incurred at a vertex on a path when two incident edges with different colors are traversed is called reload or changeover cost. The Minimum Changeover Cost Arborescence (MinCCA) problem consists in finding an arborescence with a given root vertex such that the tota...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 690; S. 91 - 103
Hauptverfasser:	Gözüpek, Didem, Özkan, Sibel, Paul, Christophe, Sau, Ignasi, Shalom, Mordechai
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 22.08.2017 Elsevier
Schlagworte:	[formula omitted] algorithm Mathematics Minimum changeover cost arborescence Parameterized complexity Planar graph Tree-cutwidth Treewidth Tree-cutwidth Minimum changeover cost arborescence FPT algorithm Planar graph Parameterized complexity Treewidth
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!