334 search results - page 11 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
SOFSEM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
WADS
2007
Springer
15 years 3 months ago
2007
Springer
SODA
2003
ACM
14 years 11 months ago
2003
ACM
103
click to vote
JUCS
2007
14 years 9 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
109
click to vote
IEICET
2011
14 years 4 months ago
2011
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...