Sciweavers

ISAAC
1997
Springer
162views Algorithms» more  ISAAC 1997»
14 years 3 months ago
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
Chung Keung Poon, Vijaya Ramachandran
ISAAC
1997
Springer
114views Algorithms» more  ISAAC 1997»
14 years 3 months ago
Algorithms for Finding Optimal Disjoint Paths Around a Rectangle
We give algorithms to find the optimal disjoint paths around a rectangle. The set of disjoint paths connects a set of sources to a set of sinks (no fixed pairing between the sour...
Wun-Tat Chan, Francis Y. L. Chin