IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v15y2012i3p308-320.html
   My bibliography  Save this article

A constructive bandwidth reduction algorithm

Author

Listed:
  • P. Arathi
  • L. Jones Tarcius Doss
  • K. Kanakadurga

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.

Suggested Citation

  • P. Arathi & L. Jones Tarcius Doss & K. Kanakadurga, 2012. "A constructive bandwidth reduction algorithm," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 15(3), pages 308-320.
  • Handle: RePEc:ids:ijores:v:15:y:2012:i:3:p:308-320
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=49484
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:15:y:2012:i:3:p:308-320. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.