Skip to main content
Article thumbnail
Location of Repository

The optimization of chordal ring networks

By P. Morillo, F. Comellas and M. A. Fiol

Abstract

This paper deals with the design of multi-(micro)computer interconnection networks modelled by graphs. In particular we concentrate upon the optimization of a new family of such networks that turn out to be a generalization of the well-known Arden and Lee's chordal ring networks. This optimization problem leads to the search for certain 3-regular graphs with minimum diameter for a given order and/or maximum order for a given diameter. The use of a geometrical approach based on plane tessellations facilitates the solution of the problem.

Publisher: World
Year: 1987
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.5679
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www-ma4.upc.edu/~comell... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.