A linear-time algorithm for computing the diameters of the incomplete WK-recursive networks

Min-Yang Su Min-Yang Su,Dyi-Rong Duh Dyi-Rong Duh,Gen-Huey Chen Gen-Huey Chen

doi:10.1109/icpads.1996.517549

A linear-time algorithm for computing the diameters of the incomplete WK-recursive networks

Min-Yang Su Min-Yang Su, Dyi-Rong Duh Dyi-Rong Duh + Show 1 more

Open Access

https://doi.org/10.1109/icpads.1996.517549

Copy DOI

Publication Date: Jun 3, 1996

Affiliation: National Taiwan University, Hwa Hsia University of Technology

#Incomplete Networks #WK-recursive Networks + Show 5 more

Abstract
Full-Text PDF
Similar Papers

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.

Full Text