Title :
Comments on "Decomposition of Permutation Networks"
Author_Institution :
Institute of Informatics, Technical University of Gdańsk
fDate :
3/1/1982 12:00:00 AM
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 :
Computer complexity; edge coloring; matrix decomposition; Informatics; Matrix decomposition; Optimal control; Partitioning algorithms; Polynomials; Routing; Switches; Computer complexity; edge coloring; matrix decomposition;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1982.1675983
