110 search results - page 4 / 22 » Minimum Bounded Degree Spanning Trees |
FSTTCS
2001
Springer
13 years 10 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
WAOA
2007
Springer
14 years 3 days ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
IPL
2007
13 years 5 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
IPPS
2003
IEEE
13 years 11 months ago
2003
IEEE
STOC
2000
ACM
13 years 10 months ago
2000
ACM
