140 search results - page 1 / 28 » Computing Minimum Spanning Trees with Uncertainty |
89
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
EOR
2006
14 years 9 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
114
click to vote
IPCV
2008
14 years 11 months ago
2008
Minimum spanning tree algorithms have been proposed for the lossy compression of image sets. In these algorithms, a complete graph is constructed from the entire image set and an ...
CATS
2007
14 years 11 months ago
2007
Given a set S of n points in the plane, a minimumdilation spanning tree of S is a tree with vertex set S of smallest possible dilation. We show that given a set S of n points and ...
EUROPAR
2007
Springer
15 years 1 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. ...