An efficient and fast parallel-connected component algorithm

@article{Han1990AnEA,
  title={An efficient and fast parallel-connected component algorithm},
  author={Yijie Han and Robert A. Wagner},
  journal={J. ACM},
  year={1990},
  volume={37},
  pages={626-642}
}
A parallel algorithm for computing the connected components of undirected graphs is presented. Shared memory computation models are assumed. For a graph of <italic>e</italic> edges and <italic>n</italic> nodes, the time complexity of the algorithm is &Ogr;(<italic>e/p</italic> + (<italic>n</italic> log <italic>n</italic>)/<italic>p</italic> + log<supscrpt>2</supscrpt><italic>n</italic>) with <italic>p</italic> processors. The algorithm can be further refined to yield time complexity &Ogr… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 39 CITATIONS

Another PRAM algorithm for finding connected components of sparse graphs

VIEW 5 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Solving Cheap Graph Problems on

  • MeshesJop F. Sibeyn, Michael KaufmannySeptember
  • 1996
VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Graph connectivity in log-diameter steps using label propagation

VIEW 1 EXCERPT

Shared-Memory Parallelism Can be Simple, Fast, and Scalable

VIEW 1 EXCERPT
CITES BACKGROUND

Common integration sites of published datasets identified using a graph-based framework

VIEW 1 EXCERPT
CITES METHODS

Pruning and preprocessing methods for inventory-aware pathfinding

VIEW 1 EXCERPT

References

Publications referenced by this paper.
SHOWING 1-4 OF 4 REFERENCES

Parallel algorithms for bucket sorting and the data dependent prefix problem

  • R WAGNER, HAN
  • In Proceedings of the 1986 International Conference on Parallel Processing (Aug.). IEEE, New York,
  • 1986
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Efficient parallel algorithms for some graph problems

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

On Parallel Searching

  • Marc Snir
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1985
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Routing, Merging, and Sorting on Parallel Models of Computation

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL