IDEAS home Printed from https://ideas.repec.org/a/ids/ijnvor/v17y2017i1p64-75.html
   My bibliography  Save this article

Embedding complete bipartite graph into grid with optimum congestion and wirelength

Author

Listed:
  • A. Berin Greeni
  • Indra Rajasingh

Abstract

Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. Graph embedding problems have gained importance in the field of interconnection networks. In this paper, we determine the congestion and wirelength of embedding complete bipartite graphs K2mn,2mn into grids M[2m × 2n], m ≤ n and cylinders P2m × C2n, m ≤ n.

Suggested Citation

  • A. Berin Greeni & Indra Rajasingh, 2017. "Embedding complete bipartite graph into grid with optimum congestion and wirelength," International Journal of Networking and Virtual Organisations, Inderscience Enterprises Ltd, vol. 17(1), pages 64-75.
    • Handle: RePEc:ids:ijnvor:v:17:y:2017:i:1:p:64-75
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=83544
    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:ijnvor:v:17:y:2017:i:1:p:64-75. 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=22 .

    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.