A new efficient parallel algorithm for minimum spanning tree (2019)
Source: Proceedings. Conference titles: International Symposium on Computer Architecture and High Performance Computing - SBAC-PAD. Unidade: IME
Subjects: GEOMETRIA E MODELAGEM COMPUTACIONAL, COMPUTAÇÃO GRÁFICA
ABNT
VASCONCELLOS, Jucele França de Alencar et al. A new efficient parallel algorithm for minimum spanning tree. 2019, Anais.. Piscataway: IEEE, 2019. Disponível em: https://doi.org/10.1109/CAHPC.2018.8645917. Acesso em: 29 ago. 2024.APA
Vasconcellos, J. F. de A., Cáceres, E. N., Mongelli, H., & Song, S. W. (2019). A new efficient parallel algorithm for minimum spanning tree. In Proceedings. Piscataway: IEEE. doi:10.1109/CAHPC.2018.8645917NLM
Vasconcellos JF de A, Cáceres EN, Mongelli H, Song SW. A new efficient parallel algorithm for minimum spanning tree [Internet]. Proceedings. 2019 ;[citado 2024 ago. 29 ] Available from: https://doi.org/10.1109/CAHPC.2018.8645917Vancouver
Vasconcellos JF de A, Cáceres EN, Mongelli H, Song SW. A new efficient parallel algorithm for minimum spanning tree [Internet]. Proceedings. 2019 ;[citado 2024 ago. 29 ] Available from: https://doi.org/10.1109/CAHPC.2018.8645917