Sign in

Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs.

David A. BaderGuojing Cong
Published in: IPDPS (2004)
Keyphrases
  • shared memory
  • efficient implementation
  • highly efficient
  • parallel architectures
  • message passing
  • distributed memory
  • address space