The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph

Guillaume Fertin, Julien Fradin, Christian Komusiewicz

Let G=(V,A) be a vertex-colored arc-weighted directed acyclic graph (DAG) rooted in some vertex r, and let H be its color hierarchy graph, defined as follows: V(H) is the color set…