117 search results - page 8 / 24 » On the directed Full Degree Spanning Tree problem |
FSTTCS
2007
Springer
15 years 3 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
2010
Springer
14 years 9 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
GD
2004
Springer
15 years 2 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
AMAI
2008
Springer
14 years 9 months ago
2008
Springer
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
SIGCOMM
2000
ACM
15 years 1 months ago
2000
ACM
As the number of hosts attached to a network increases beyond what can be connected by a single local area network (LAN), forwarding packets between hosts on different LANs become...