LACC: A Linear-Algebraic Algorithm for Finding Connected Components in Distributed Memory

Ariful Azad, Aydin Buluç. LACC: A Linear-Algebraic Algorithm for Finding Connected Components in Distributed Memory. In 2019 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2019, Rio de Janeiro, Brazil, May 20-24, 2019. pages 2-12, IEEE, 2019. [doi]

@inproceedings{AzadB19,
  title = {LACC: A Linear-Algebraic Algorithm for Finding Connected Components in Distributed Memory},
  author = {Ariful Azad and Aydin Buluç},
  year = {2019},
  doi = {10.1109/IPDPS.2019.00012},
  url = {https://doi.org/10.1109/IPDPS.2019.00012},
  researchr = {https://researchr.org/publication/AzadB19},
  cites = {0},
  citedby = {0},
  pages = {2-12},
  booktitle = {2019 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2019, Rio de Janeiro, Brazil, May 20-24, 2019},
  publisher = {IEEE},
  isbn = {978-1-7281-1246-6},
}