Performance evaluation of a random-walk-based algorithm for embedding dynamically evolving trees in hypercubic networks.

Published in: Concurr. Pract. Exp. (2004)

Keyphrases

random walk
dynamic programming
learning algorithm
k means
similarity measure
search space
random walker
multi db
markov chain
expectation maximization
transition probability matrix
directed graph
dynamically evolving
pagerank algorithm
hyper graph
spectral graph partitioning
graph structure
tree structure
np hard