Issue No.03 - March (1982 vol.31)
M. Kubale , Institute of Informatics, Technical University of Gdansk
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.
matrix decomposition, Computer complexity, edge coloring
M. Kubale, "Comments on "Decomposition of Permutation Networks"", IEEE Transactions on Computers, vol.31, no. 3, pp. 265, March 1982, doi:10.1109/TC.1982.1675983