Blar i Department of Informatics på emneord "Lower bounds"
Viser treff 1-1 av 1
-
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves
(Peer reviewed; Journal article, 2009)The {\sc \(k\)-Leaf Out-Branching} problem is to find an out-branching, that is a rooted oriented spanning tree, with at least \(k\) leaves in a given digraph. The problem has recently received much attention from the ...