Title: A constructive bandwidth reduction algorithm

Authors: P. Arathi; L. Jones Tarcius Doss; K. Kanakadurga

Addresses: The Department of Mathematics, CEG, Anna University, Chennai 600025, Tamilnadu, India ' The Department of Mathematics, CEG, Anna University, Chennai 600025, Tamilnadu, India ' The Department of Mathematics, CEG, Anna University, Chennai 600025, Tamilnadu, India

Abstract: In this paper, a viable bandwidth minimisation algorithm based on graphs, for reducing the bandwidth of sparse symmetric matrices, is presented. The algorithm is tested for various sparse symmetric matrices arising from standard structured and random graphs. Bandwidth results for these matrices are also obtained using the existing algorithms and compared. The proposed algorithm is easy to implement and the bandwidth reductions obtained with the proposed algorithm are good when compared with the existing algorithms.

Keywords: bandwidth reduction; sparse symmetric matrix; bandwidth minimisation; graphs.

DOI: 10.1504/IJOR.2012.049484

International Journal of Operational Research, 2012 Vol.15 No.3, pp.308 - 320

Published online: 11 Jan 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article