Please use this identifier to cite or link to this item:
http://repositorio.ufla.br/jspui/handle/1/41543| Title: | An Experimental Analysis of Three Pseudo-peripheral Vertex Finders in conjunction with the Reverse Cuthill-McKee Method for Bandwidth Reduction |
| Keywords: | Sparse matrices Graph labeling Graph algorithm Reverse Cuthill-McKee method Bandwidth reduction Graph theory Matrizes esparsas Numeração de vértices de grafos Algoritmos em grafos Método Reverse Cuthill-McKee Redução de largura de banda Teoria dos grafos |
| Issue Date: | Dec-2019 |
| Publisher: | Sociedade Brasileira de Matemática Aplicada e Computacional |
| Citation: | OLIVEIRA, S. L. G. de; ABREU, A. A. A. M. An Experimental Analysis of Three Pseudo-peripheral Vertex Finders in conjunction with the Reverse Cuthill-McKee Method for Bandwidth Reduction. TEMA, São Carlos, v. 20, n. 3, p. 497-507, 2019. |
| Abstract: | The need to determine pseudoperipheral vertices arises from several graph-theoretical approaches for ordering sparse matrix equations. The results of two algorithms for finding such vertices, namely, the George-Liu and Kaveh-Bondarabady algorithms, are evaluated in this work along with a variant of the Kaveh-Bondarabady algorithm. The results suggest that the well-know George-Liu algorithm dominates the other two pseudoperipheral vertex finders mainly when considering the computational times of the algorithms. |
| URI: | http://repositorio.ufla.br/jspui/handle/1/41543 |
| Appears in Collections: | DCC - Artigos publicados em periódicos |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ARTIGO_An Experimental Analysis of Three Pseudo-peripheral Vertex Finders in conjunction with the Reverse Cuthill-McKee Method for Bandwidth Reduction.pdf | 803,7 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License
Admin Tools