6 search results - page 1 / 2 » isaac 1997 |
ISAAC
1997
Springer
13 years 11 months ago
1997
Springer
CHI
1997
ACM
13 years 11 months ago
1997
ACM
ISAAC
1997
Springer
13 years 11 months ago
1997
Springer
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...
ISAAC
2000
Springer
13 years 11 months ago
2000
Springer
We describe an algorithm for enumerating all vertices, edges and faces of a planar subdivision stored in any of the usual pointer-based representations, while using only a constant...
ISAAC
1997
Springer
13 years 11 months ago
1997
Springer
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...