A fast parallel algorithm for finding Hamiltonian cycles in dense graphs.

Gábor N. Sárközy

Published in: Discret. Math. (2009)

Keyphrases

parallel algorithm
shared memory
parallel computation
parallel programming
binary search trees
discovery of association rules
cluster of workstations
graph mining
parallel version
parallel implementations
multiscale
association rules
peer to peer
message passing interface
medial axis transform