A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk.

H. K. Dai Zhu Wang

Published in: LATA (2015)

Keyphrases

random walk
parallel algorithm
parallel computation
markov chain
shared memory
transition probabilities
cluster of workstations
parallel implementations
medial axis transform
transition probability matrix
directed graph
binary search trees
markov random walk
np complete
multi db