A linear-time algorithm for computing the diameters of the incomplete WK-recursive networks
Resource
Parallel and Distributed Systems, 1996. Proceedings., 1996 International Conference on
Journal
1996 International Conference on Parallel and Distributed Systems, 1996
Pages
-
Date Issued
1996-06
Date
1996-06
Author(s)
DOI
N/A
Abstract
The WK-recursive networks, which were originally proposed by Vecchia and Sanges, have suffered from the rigorous restriction on the number of nodes. Like the other incomplete networks, the incomplete WK-recursive networks have been proposed to relieve this restriction. In this paper, it is first shown that the structures of the incomplete WK-recursive networks are conveniently represented with multistage graphs. This representation can provide a uniform look at the incomplete WK-recursive networks. With its help, a linear-time algorithm using the prune-and-search technique is presented for computing the diameters of the incomplete WK-recursive networks.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00517549.pdf
Size
715.79 KB
Format
Adobe PDF
Checksum
(MD5):b8b61f2ad097dc6b6d171f3a4d8fcf85