140 search results - page 8 / 28 » Computing Minimum Spanning Trees with Uncertainty |
GREC
2003
Springer
15 years 4 months ago
2003
Springer
We present a structural analysis method for the recognition of on-line handwritten mathematical expressions based on a minimum spanning tree construction and symbol dominance. The ...
132
Voted
PODC
2009
ACM
16 years 6 days ago
2009
ACM
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
106
Voted
COMPGEOM
2000
ACM
15 years 4 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
99
Voted
STOC
2004
ACM
15 years 12 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...