๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The infinite families of optimal double loop networks

โœ Scribed by Q. Li; J.M. Xu; Z.L. Zhang

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
263 KB
Volume
46
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimal diameter double-loop networks: D
Minimal diameter double-loop networks: Dense optimal families
โœ J.-C. Bermond; Dvora Tzvieli ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 370 KB

This article deals with the problem of minimizing the transmission delay in Illiac-type interconnection networks for parallel or distributed architectures or in local area networks. A double-loop network (also known as circulant) G(n,h), consists of a loop of n vertices where each vertex i is also j

An efficient algorithm to find optimal d
An efficient algorithm to find optimal double loop networks
โœ F. Aguilรณ; M.A. Fiol ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 527 KB

The problem of finding optimal diameter double loop networks with a fixed number of vertices has been widely studied. In this work, we give an algorithmic solution of the problem by using a geometrical approach. Given a fixed number of vertices n, the general problem is to find "steps" s 1 , s z e