On computing the combinatorial power of SW-banyan networks
R.S. Roberts, Suraj C. Kothari · IEEE Transactions on Computers · 1989
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.>