Publication year: 2011
Source: Operations Research Letters, Available online 12 September 2011
L. Jones Tarcius Doss, P. Arathi
In this paper, a viable bandwidth reduction algorithm based on graphs for reducing the bandwidth of sparse symmetric matrices, arising from standard L-structured and Z-structured graphs, is presented. Bandwidth results for these matrices are obtained using this algorithm and compared with that of existing algorithms. This algorithm can easily be applied to these matrices while the bandwidths obtained are as good as those obtained with the existing algorithms.
Highlights
► In this study we have proposed an effective bandwidth reduction algorithm. ► This algorithm is modeled mainly for structured graphs such as the L-structured and Z-structured graphs of any size. ► A near optimal value is obtained on implementing the algorithm for the above two structured graphs.