Browsing Department of Informatics by Subject "FPT-algorithms"
Now showing items 1-1 of 1
(Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, 2014)We study the paramereteized complexity of the following connectivity problem. For a vertex subset U of a graph G, trees T1, . . . , Ts of G are completely independent spanning trees of U if each of them contains U , and ...Conference object