A coarse-grained parallel algorithm for spanning tree and connected components (2004)
Cáceres, Edson Norberto; Dehne, Frank; Mongelli, Henrique 
; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Fonte: Proceedings. Nome do evento: European Conference on Parallel Processing - Euro-Par. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CÁCERES, Edson Norberto et al. A coarse-grained parallel algorithm for spanning tree and connected components. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-27866-5_110. Acesso em: 28 ago. 2024.APA
Cáceres, E. N., Dehne, F., Mongelli, H., Song, S. W., & Szwarcfiter, J. L. (2004). A coarse-grained parallel algorithm for spanning tree and connected components. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-27866-5_110NLM
Cáceres EN, Dehne F, Mongelli H, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2004 ;[citado 2024 ago. 28 ] Available from: https://doi.org/10.1007/978-3-540-27866-5_110Vancouver
Cáceres EN, Dehne F, Mongelli H, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2004 ;[citado 2024 ago. 28 ] Available from: https://doi.org/10.1007/978-3-540-27866-5_110
