A constructive bandwidth reduction algorithm -- a variant of GPS algorithm

DOI10.1016/j.akcej.2016.06.014zbMath1358.65026OpenAlexW2476862062MaRDI QIDQ504151

P. Arathi, L. Jones Tarcius Doss

Publication date: 25 January 2017

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2016.06.014

zbMATH Keywords

bandwidth reductionsparse symmetric matrixBFS algorithmGPS algorithmreordering of graph vertices

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
• GRASP and path relinking for the matrix bandwidth minimization.
• Algorithms for reducing the bandwidth and profile of a sparse matrix
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• A spectral algorithm for envelope reduction of sparse matrices
• Nodal ordering for bandwidth reduction using ant system algorithm

This page was built for publication: A constructive bandwidth reduction algorithm -- a variant of GPS algorithm