Comments on "Decomposition of Permutation Networks"
- 1 March 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (3) , 265
- https://doi.org/10.1109/TC.1982.1675983
Abstract
A counterexample is given to show the partial correctness of a matrix decomposition algorithm proposed by Ramanujam in 1973. It is pointed out that the edge coloring approach results in the most efficient algorithms for the decomposition problem.Keywords
This publication has 3 references indexed in Scilit:
- A fast parallel algorithm for routing in permutation networksIEEE Transactions on Computers, 1981
- Algorithms for edge coloring bipartite graphsPublished by Association for Computing Machinery (ACM) ,1978
- Using euler partitions to edge color bipartite multigraphsInternational Journal of Parallel Programming, 1976