An evaluation of pseudoperipheral vertex finders for the Reverse Cuthill-McKee method for bandwidth and profile reductions of symmetric matrices

Previous publications have reviewed the main algorithms for the identification of pseudoperipheral vertices in graphs. Based on this experience, this paper evaluates seven promising methods for solving the problem of finding a proper pseudoperipheral vertex in a graph. This paper analyzes these seve...

Full description

Saved in:
Bibliographic Details
Published in2018 37th International Conference of the Chilean Computer Science Society (SCCC) pp. 1 - 9
Main Authors Gonzaga de Oliveira, Sanderson L., de Abreu, Alexandre A. A. M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2018
Subjects
Approximation algorithms
Bandwidth
bandwidth reduction
graph labeling
graph theory
Heuristic algorithms
Labeling
Level set
ordering
profile reduction
renumbering
reordering algorithms
Reverse Cuthill-McKee method
Software algorithms
Sparse matrices
Symmetric matrices
Online AccessGet full text
DOI10.1109/SCCC.2018.8705263

Cover

More Information
Summary:Previous publications have reviewed the main algorithms for the identification of pseudoperipheral vertices in graphs. Based on this experience, this paper evaluates seven promising methods for solving the problem of finding a proper pseudoperipheral vertex in a graph. This paper analyzes these seven pseudoperipheral vertex finders along with a new variant of Kaveh's B algorithm. This paper evaluates these algorithms with the purpose of identifying proper starting vertices for the Reverse Cuthill-McKee method. Extensive experiments among these pseudoperipheral vertex finders show that the George-Liu algorithm remains in the state of the practice to provide pseudoperipheral vertices to the Reverse Cuthill-McKee method when applied to matrices with symmetric sparsity patterns.
DOI:10.1109/SCCC.2018.8705263