M. Asokan. A robust, efficient, and balanced parallel algorithm for finding connected components. In 2019 IEEE International Conference on Big Data (Big Data), Los Angeles, CA, USA, December 9-12, 2019. pages 2113-2118, IEEE, 2019. [doi]
@inproceedings{Asokan19-0,
title = {A robust, efficient, and balanced parallel algorithm for finding connected components},
author = {M. Asokan},
year = {2019},
doi = {10.1109/BigData47090.2019.9006189},
url = {https://doi.org/10.1109/BigData47090.2019.9006189},
researchr = {https://researchr.org/publication/Asokan19-0},
cites = {0},
citedby = {0},
pages = {2113-2118},
booktitle = {2019 IEEE International Conference on Big Data (Big Data), Los Angeles, CA, USA, December 9-12, 2019},
publisher = {IEEE},
isbn = {978-1-7281-0858-2},
}