Embedding complete bipartite graph into grid with optimum congestion and wirelength

A. Berin Greeni and Indra Rajasingh

International Journal of Networking and Virtual Organisations, 2017, vol. 17, issue 1, 64-75

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 K_2mn,2mn into grids M[2m × 2n], m ≤ n and cylinders P_2m × C_2n, m ≤ n.

Keywords: embedding; congestion; edge isoperimetric problem; complete bipartite graph; grid; cylinder. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

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

Access Statistics for this article

More articles in International Journal of Networking and Virtual Organisations from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().