Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs (extended abstract )

This publication has 21 references indexed in Scilit:

• Cell migration and proliferation are not discriminatory factors in the in vitro sociologic behavior of bronchial epithelial cell lines
  Cell Motility, 2002
• Concurrent threads and optimal parallel minimum spanning trees algorithm
  Journal of the ACM, 2001
• A fast implementation of the minimum spanning tree method for phase unwrapping
  IEEE Transactions on Medical Imaging, 2000
• Simple: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs)
  Journal of Parallel and Distributed Computing, 1999
• Building a multicasting tree in a high-speed network
  IEEE Concurrency, 1998
• Random permutations on distributed, external and hierarchical memory
  Information Processing Letters, 1998
• Application of Computer‐assisted Morphometry to the Analysis of Prenatal Development of Human Lung
  Anatomia, Histologia, Embryologia, 1997
• Multivariate analysis by the minimum spanning tree method of the structural determinants of diphenylethylenes and triphenylacrylonitriles implicated in estrogen receptor binding, protein kinase C activity, and MCF7 cell proliferation
  Journal of Medicinal Chemistry, 1992
• Parallel ear decomposition search (EDS) and st-numbering in graphs
  Theoretical Computer Science, 1986
• On efficient parallel strong orientation
  Information Processing Letters, 1985