Application of Graph Sparsification in Developing Parallel Algorithms for Updating Connected Components

2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) ◽

10.1109/ipdpsw.2016.180 ◽

2016 ◽

Author(s):

Sriram Srinivasan ◽

Sanjukta Bhowmick ◽

Sajal Das

Keyword(s):

Parallel Algorithms ◽

Connected Components ◽

Graph Sparsification

Download Full-text

BFS and Coloring-Based Parallel Algorithms for Strongly Connected Components and Related Problems

2014 IEEE 28th International Parallel and Distributed Processing Symposium ◽

10.1109/ipdps.2014.64 ◽

2014 ◽

Author(s):

George M. Slota ◽

Sivasankaran Rajamanickam ◽

Kamesh Madduri

Keyword(s):

Parallel Algorithms ◽

Connected Components ◽

Strongly Connected Components ◽

Strongly Connected

Download Full-text

Improved parallel algorithms for finding connected components

Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing ◽

10.1109/icapp.1995.472217 ◽

2002 ◽

Author(s):

K.W. Chong ◽

T.W. Lam

Keyword(s):

Parallel Algorithms ◽

Connected Components

Download Full-text

Parallel algorithms for finding connected components using linear algebra

Journal of Parallel and Distributed Computing ◽

10.1016/j.jpdc.2020.04.009 ◽

2020 ◽

Vol 144 ◽

pp. 14-27

Author(s):

Yongzhe Zhang ◽

Ariful Azad ◽

Aydın Buluç

Keyword(s):

Parallel Algorithms ◽

Linear Algebra ◽

Connected Components

Download Full-text

Parallel algorithms for the connected components and minimal spanning tree problems

Information Processing Letters ◽

10.1016/0020-0190(82)90131-4 ◽

1982 ◽

Vol 14 (1) ◽

pp. 7-11 ◽

Author(s):

Dhruva Nath ◽

S.N. Maheshwari

Keyword(s):

Parallel Algorithms ◽

Spanning Tree ◽

Connected Components ◽

Minimal Spanning Tree

Download Full-text

A comparison of parallel algorithms for connected components

Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures - SPAA '94 ◽

10.1145/181014.181021 ◽

1994 ◽

Author(s):

John Greiner

Keyword(s):

Parallel Algorithms ◽

Connected Components

Download Full-text

Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing - PODC '19 ◽

10.1145/3293611.3331596 ◽

2019 ◽

Author(s):

Sepehr Assadi ◽

Xiaorui Sun ◽

Omri Weinstein

Keyword(s):

Parallel Algorithms ◽

Massively Parallel ◽

Connected Components ◽

Download Full-text

Parallel algorithms for image histogramming and connected components with an experimental study (extended abstract)

ACM SIGPLAN Notices ◽

10.1145/209937.209950 ◽

1995 ◽

Vol 30 (8) ◽

pp. 123-133

Author(s):

David A. Bader ◽

Joseph JáJá

Keyword(s):

Experimental Study ◽

Parallel Algorithms ◽

Connected Components

Download Full-text

Parallel algorithms for connected components in a graph

Fundamentals of Computation Theory - Lecture Notes in Computer Science ◽

10.1007/bfb0028804 ◽

2006 ◽

pp. 208-217 ◽

Author(s):

Václav Koubek ◽

Jana Kršňáková

Keyword(s):

Parallel Algorithms ◽

Connected Components

Download Full-text

Parallel algorithms for image histogramming and connected components with an experimental study (extended abstract)

Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming - PPOPP '95 ◽

10.1145/209936.209950 ◽

1995 ◽

Author(s):

David A. Bader ◽

Joseph JáJá

Keyword(s):

Experimental Study ◽

Parallel Algorithms ◽

Connected Components

Download Full-text

A new class of parallel algorithms for finding connected components on machines with bit-vector operations

Information Sciences ◽

10.1016/0020-0255(94)90009-4 ◽

1994 ◽

Vol 76 (3-4) ◽

pp. 177-195

Author(s):

Y. Liang ◽

S.K. Dhall ◽

S. Lakshmivarahan

Keyword(s):

Parallel Algorithms ◽

Connected Components ◽

New Class ◽

Download Full-text