Login / Signup
Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph.
K. S. Easwarakumar
S. V. Krishnan
C. Pandu Rangan
S. Seshadri
Published in:
Algorithmica (1996)
Keyphrases
</>
parallel algorithm
binary search trees
parallel computation
parallel programming
dynamic programming
shared memory
planar graphs
cluster of workstations
optimal solution
graph structure
medial axis transform
parallel computers
parallel version
dominant points
discovery of association rules