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

DOI10.1016/J.AKCEJ.2016.06.014zbMATH Open1358.65026OpenAlexW2476862062MaRDI QIDQ504151FDOQ504151

Authors: L. Jones Tarcius Doss, P. Arathi 

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

Recommendations

• A constructive bandwidth reduction algorithm
• A new matrix bandwidth reduction algorithm
• A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
• scientific article
• scientific article; zbMATH DE number 975329

zbMATH Keywords

sparse symmetric matrixbandwidth reductionBFS algorithmGPS algorithmreordering of graph vertices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50)

Cites Work

• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• GRASP and path relinking for the matrix bandwidth minimization.
• Nodal ordering for bandwidth reduction using ant system algorithm
• Algorithms for reducing the bandwidth and profile of a sparse matrix
• Title not available (Why is that?)
• A spectral algorithm for envelope reduction of sparse matrices
• A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs

Cited In (6)

• A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
• Title not available (Why is that?)
• A constructive bandwidth reduction algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new node renumbering algorithm for bandwidth reduction

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q504151)