106 search results - page 2 / 22 » An Exact Algorithm for the Maximum Leaf Spanning Tree Proble... |
FSTTCS
2007
Springer
14 years 1 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...
WG
2009
Springer
14 years 1 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
TALG
2010
13 years 5 months ago
2010
CORR
2008
Springer
13 years 7 months ago
2008
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 pap...
FLAIRS
2001
13 years 8 months ago
2001
Decisionand optimizationproblemsinvolvinggraphsarise in manyareas of artificial intelligence, including probabilistic networks, robot navigation, and network design. Manysuch prob...