Parameterized complexity of the MINCCA problem on graphs of bounded decomposability

DOI10.1007/978-3-662-53536-3_17MaRDI QIDQ6828430zbMATH OpenFDO

Authors Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom

Publication date 22 December 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-53536-3_17

zbMATH Keywords

\(\mathsf{FPT}\) algorithmdynamic programmingminimum changeover cost arborescenceparameterized complexityplanar graphtreewidth

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: Parameterized complexity of the MINCCA problem on graphs of bounded decomposability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6828430)