672 search results - page 9 / 135 » Lower-stretch spanning trees |
100
Voted
SWAT
1990
Springer
15 years 7 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
145
Voted
ALGORITHMICA
2000
15 years 3 months ago
2000
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
165
Voted
FSTTCS
2001
Springer
15 years 8 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...
156
Voted
ICPADS
2007
IEEE
15 years 10 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
105
click to vote
EUROPAR
2007
Springer
15 years 7 months ago
2007
Springer
In many network applications the computation takes place on the minimum-cost spanning tree (MST) of the network; unfortunately, a single link or node failure disconnects the tree. ...