Exact wirelength of embedding chord graph into tree-based architectures Online publication date: Mon, 10-Apr-2017
by N. Parthiban; Joe Ryan; Indra Rajasingh; R. Sundara Rajan; L. Nirmala Rani
International Journal of Networking and Virtual Organisations (IJNVO), Vol. 17, No. 1, 2017
Abstract: Graph embedding has gained importance in the field of interconnection networks and virtual networks to study the computational capabilities of networks. An overlay is a logical network on top of a physical network. The chord architecture is a powerful overlay network. In this paper we embed chord graphs into certain trees for minimising wirelength.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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:
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