A constructive bandwidth reduction algorithm

P. Arathi, L. Jones Tarcius Doss and K. Kanakadurga

International Journal of Operational Research, 2012, vol. 15, issue 3, 308-320

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. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=49484 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:15:y:2012:i:3:p:308-320

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().