140 search results - page 16 / 28 » Computing Minimum Spanning Trees with Uncertainty |
SODA
1994
ACM
15 years 1 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
108
click to vote
SODA
2008
ACM
15 years 1 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
124
click to vote
CCCG
2003
15 years 1 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
116
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...