Embedding complete bipartite graph into grid with optimum congestion and wirelength
by A. Berin Greeni; Indra Rajasingh
International Journal of Networking and Virtual Organisations (IJNVO), Vol. 17, No. 1, 2017

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.

Online publication date: Mon, 10-Apr-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Networking and Virtual Organisations (IJNVO):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com