Login / Signup
On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph.
Neil J. Calkin
Alan M. Frieze
Ludek Kucera
Published in:
Random Struct. Algorithms (1992)
Keyphrases
</>
parallel algorithm
random graphs
graph theoretic
parallel computation
cluster of workstations
shared memory
parallel programming
dominant points
binary search trees
parallel version
parallel implementations
orders of magnitude
phase transition
medial axis transform
discovery of association rules