An Efficient Parallel Algorithm for Maximum Matching for Some Classes of Graphs.
Igor ParfenoffPublished in: J. Parallel Distributed Comput. (1998)
Keyphrases
- parallel algorithm
- maximum matching
- bipartite graph
- parallel computation
- stable set
- parallel programming
- shared memory
- binary search trees
- medial axis transform
- link prediction
- cluster of workstations
- discovery of association rules
- parallel implementations
- parallel processing
- computationally efficient
- markov chain
- social networks