4 search results - page 1 / 1 » On Complexity of Minimum Leaf Out-branching Problem |
AAIM
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in D an out-branching with the minimum possible number of leaves, i.e., vert...
FSTTCS
2007
Springer
13 years 10 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
CIE
2007
Springer
13 years 10 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....