A comparison of pseudoperipheral vertex finders for the Reverse Cuthill-McKee method

Favorite this paper
How to cite this paper?
Details
  • Presentation type: Trabalho completo (oral)
  • Track: 19. TAG – Teoria e Algoritmos em Grafos
  • Keywords: Bandwidth reduction; Sparse matrices; graph labeling;
  • 1 Instituto Federal de Educação, Ciência e Tecnologia de Santa Catarina
  • 2 Universidade Federal de Lavras
  • 3 Universidade Federal de Lavras - Departamento de Ciência da Computação

A comparison of pseudoperipheral vertex finders for the Reverse Cuthill-McKee method

Alexandre Augusto Alberto Moreira de Abreu

Instituto Federal de Educação, Ciência e Tecnologia de Santa Catarina

Abstract

Previous publications reviewed several pseudoperipheral vertex finders in graphs for the Reverse Cuthill-McKee method. Based on this experience, this paper evaluates the George-Liu algorithm against three other methods for solving the problem of finding a proper pseudoperipheral vertex in a graph. The results show that the George-Liu algorithm remains in the state of the practice for providing pseudoperipheral vertices for the Reverse Cuthill-McKee method when applied to matrices with symmetric sparsity patterns.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!