Efficient parallel graph algorithms for coarse grained multicomputers and BSP (1997)
Cáceres, Edson Norberto 
; Dehne, Frank; Ferreira, A; Flocchini, P; Rieping, I; Roncato, A; Santoro, N; Song, Siang Wun
Source: Proceedings. Conference titles: International Colloquium on Automata, Languages, and Programming - ICALP. 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. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. 1997, Anais.. Berlin: Springer, 1997. Disponível em: https://doi.org/10.1007/3-540-63165-8_195. Acesso em: 29 jul. 2024.APA
Cáceres, E. N., Dehne, F., Ferreira, A., Flocchini, P., Rieping, I., Roncato, A., et al. (1997). Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proceedings. Berlin: Springer. doi:10.1007/3-540-63165-8_195NLM
Cáceres EN, Dehne F, Ferreira A, Flocchini P, Rieping I, Roncato A, Santoro N, Song SW. Efficient parallel graph algorithms for coarse grained multicomputers and BSP [Internet]. Proceedings. 1997 ;[citado 2024 jul. 29 ] Available from: https://doi.org/10.1007/3-540-63165-8_195Vancouver
Cáceres EN, Dehne F, Ferreira A, Flocchini P, Rieping I, Roncato A, Santoro N, Song SW. Efficient parallel graph algorithms for coarse grained multicomputers and BSP [Internet]. Proceedings. 1997 ;[citado 2024 jul. 29 ] Available from: https://doi.org/10.1007/3-540-63165-8_195
