New BSP/CGM algorithms for spanning trees (2019)
- Authors:
- Autor USP: SONG, SIANG WUN - IME
- Unidade: IME
- DOI: 10.1177/1094342018803672
- Assunto: REDES DE COMPUTADORES
- Keywords: Spanning tree; minimum spanning tree; parallel algorithm; BSP/CGM model; GPU
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher place: Thousand Oaks
- Date published: 2019
- Source:
- Título: The International Journal of High Performance Computing Applications
- ISSN: 1094-3420
- Volume/Número/Paginação/Ano: v. 33, n. 3, p. 444-461, 2019
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
VASCONCELLOS, Jucele França de Alencar et al. New BSP/CGM algorithms for spanning trees. The International Journal of High Performance Computing Applications, v. 33, n. 3, p. 444-461, 2019Tradução . . Disponível em: https://doi.org/10.1177/1094342018803672. Acesso em: 30 dez. 2025. -
APA
Vasconcellos, J. F. de A., Cáceres, E. N., Mongelli, H., Song, S. W., Dehne, F., & Szwarcfiter, J. L. (2019). New BSP/CGM algorithms for spanning trees. The International Journal of High Performance Computing Applications, 33( 3), 444-461. doi:10.1177/1094342018803672 -
NLM
Vasconcellos JF de A, Cáceres EN, Mongelli H, Song SW, Dehne F, Szwarcfiter JL. New BSP/CGM algorithms for spanning trees [Internet]. The International Journal of High Performance Computing Applications. 2019 ; 33( 3): 444-461.[citado 2025 dez. 30 ] Available from: https://doi.org/10.1177/1094342018803672 -
Vancouver
Vasconcellos JF de A, Cáceres EN, Mongelli H, Song SW, Dehne F, Szwarcfiter JL. New BSP/CGM algorithms for spanning trees [Internet]. The International Journal of High Performance Computing Applications. 2019 ; 33( 3): 444-461.[citado 2025 dez. 30 ] Available from: https://doi.org/10.1177/1094342018803672 - Comprehensive evaluation of a two dimensional configurable array
- Towards a simple construction method for hamiltonian decomposition of the hypercube
- Revisiting cycle shrinking
- Randomized parallel list ranking for distributed memory multiprocessors
- A BSP/CGM algorithm for the all-substrings longest common subsequence problem
- A parallel solution to infer genetic network architectures in gene expression analysis
- A range minima parallel algorithm for coarse grained multicomputers
- Efficient implementation of the BSP/CGM parallel vertex cover FPT algorithm
- Message from de guest editors
- Reconhecimento de linguagens regulares por standard cells
Informações sobre o DOI: 10.1177/1094342018803672 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2922177.pdf | ||
 |
2922177.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
