Issue No.05 - May (1989 vol.38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.24281
The problem of calculating the combinatorial power of certain SW-banyan networks is related to a problem of enumerating certain matrices. Examples of two- and three-stage networks are used to demonstrate the technique. In each case, a polynomial-time algorithm is found to solve the problem. The results are presented for each case and certain asymptotic behavior is noted.
two-stage networks; combinatorial power; SW-banyan networks; matrices; three-stage networks; polynomial-time algorithm; asymptotic behavior; computational complexity; graph theory; matrix algebra.
R.S. Roberts, "On Computing the Combinatorial Power of SW-Banyan Networks", IEEE Transactions on Computers, vol.38, no. 5, pp. 761-765, May 1989, doi:10.1109/12.24281