Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs.

David A. Bader Guojing Cong

Published in: J. Parallel Distributed Comput. (2006)

Keyphrases

shared memory
parallel architectures
parallel computing
higher order
graph cuts
parallel algorithm
belief propagation
parallel processing
message passing
spanning tree
subgraph isomorphism
graphic processing unit