Technical Report CS736

TR#:CS736
Title: CONNECTIONS BETWEEN TWO CYCLES - A NEW DESIGN OF DENSE PROCESSOR INTERCONNECTION NETWORKS (Revised Version).
Authors: R. Bar-Yehuda, T. Etzion
PDFNot Available
Abstract:

In this paper we attempt to maximize the order of graphs of given degree \triangle and diameter D. These graphs, which are known as (\Triangle, D) graphs, are used as dense interconnection networks, i.e., processors with relatively few links are connected with relatively short paths. The method described in this paper uses periodic connections between two cycles of the same length. The results obtained give a significant improvement of the known lower bounds in many cases. Large bipartite graphs with a given degree and diameter were also obtained by our method. Again, the improvement of the lower bounds is significant.

CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1992/CS/CS0736), rather than to the URL of the PDF or PS files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1992
To the main CS technical reports page

Computer science department, Technion