277 search results - page 11 / 56 » The saga of minimum spanning trees |
CIAC
2000
Springer
14 years 3 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
STOC
2007
ACM
14 years 11 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
EOR
2008
13 years 11 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
SIAMCOMP
2000
13 years 10 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 ...
ICALP
2001
Springer
14 years 3 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 ...