102 search results - page 12 / 21 » Spanning trees with minimum weighted degrees |
124
click to vote
DAM
1999
15 years 1 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
133
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
125
click to vote
DM
2008
15 years 1 months ago
2008
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
126
click to vote
ALGORITHMICA
2002
15 years 1 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
107
click to vote
CORR
2010
Springer
15 years 1 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...