Sciweavers

Share
283 search results - page 1 / 57
» The saga of minimum spanning trees
Sort
View
LATIN
1995
Springer
9 years 7 months ago
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...
David Fernández-Baca, Giora Slutzki
DM
2010
86views more  DM 2010»
9 years 3 months ago
Minimum congestion spanning trees in planar graphs
: The main purpose of the paper is to develop an approach to the evaluation or the estimation of the spanning tree congestion of planar graphs. This approach is used to evaluate th...
M. I. Ostrovskii
IPCV
2008
9 years 5 months ago
Hierarchical Minimum Spanning Trees for Lossy Image Set Compression
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 ...
Anthony Schmieder, Howard Cheng, Barry Gergel, Xia...
COMPGEOM
2003
ACM
9 years 9 months ago
Euclidean bounded-degree spanning tree ratios
Let τK be the worst-case (supremum) ratio of the weight of the minimum degree-K spanning tree to the weight of the minimum spanning tree, over all finite point sets in the Eu
Timothy M. Chan
books