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
Diameters of weighted double loop networks
β Scribed by Ying Cheng; Frank K Hwang
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 454 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Given relatively prime integers N,a~,...,ak, a multi-connected loop network is defined as the directed graph with vertex set Z/NZ = {0, 1 ..... N -1}, and directed edges i ~ r :-i+ aj (mod N). If each edge i ---, i+ aJ is given a positive real weight wj for j = 1 ..... k, then we have a weighted mul
The authors wish to thank the anonymous referees for detailed reading of the manuscript. Their comments enabled us to improve the quality of the manuscript considerably, in particular to complete proofs of Lemmas 2 and 5 . We also thank John Shawe-Taylor for careful reading of the final version of t