970 search results - page 25 / 194 » On encodings of spanning trees |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
SIAMCOMP
2000
13 years 7 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
SIAMNUM
2010
13 years 2 months ago
2010
Two algorithms based upon a tree-cotree decomposition, called in this paper spanning tree technique (STT) and generalized spanning tree technique (GSTT), have been shown to be usef...
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
EOR
2008
13 years 7 months ago
2008
We introduce optimistic weighted Shapley rules in minimum cost spanning tree problems. We dene them as the weighted Shapley values of the optimistic game v+ introduced in Berganti