Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components (2010)
- Authors:
- Autor USP: SONG, SIANG WUN - IME
- Unidade: IME
- DOI: 10.1109/HPCS.2010.5547062
- Subjects: ALGORITMOS; ALGORITMOS PARA PROCESSAMENTO; TEORIA DOS GRAFOS
- Keywords: parallel algorithm; spanning tree; graph problems
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: IEEE
- Publisher place: Piscataway
- Date published: 2010
- Source:
- Título: Proceedings
- Conference titles: International conference on High Peformance Computing and Simulation - HPCS
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
CÁCERES, Edson Norberto et al. Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components. 2010, Anais.. Piscataway: IEEE, 2010. Disponível em: https://doi.org/10.1109/HPCS.2010.5547062. Acesso em: 30 dez. 2025. -
APA
Cáceres, E. N., Mongelli, H., Nishibe, C., & Song, S. W. (2010). Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components. In Proceedings. Piscataway: IEEE. doi:10.1109/HPCS.2010.5547062 -
NLM
Cáceres EN, Mongelli H, Nishibe C, Song SW. Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2010 ;[citado 2025 dez. 30 ] Available from: https://doi.org/10.1109/HPCS.2010.5547062 -
Vancouver
Cáceres EN, Mongelli H, Nishibe C, Song SW. Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2010 ;[citado 2025 dez. 30 ] Available from: https://doi.org/10.1109/HPCS.2010.5547062 - 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.1109/HPCS.2010.5547062 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
