|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| M. Kubale, "Comments on "Decomposition of Permutation Networks"," IEEE Transactions on Computers, vol. 31, no. 3, pp. 265, March, 1982. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1982.1675983, author = {M. Kubale}, title = {Comments on "Decomposition of Permutation Networks"}, journal ={IEEE Transactions on Computers}, volume = {31}, number = {3}, issn = {0018-9340}, year = {1982}, pages = {265}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1982.1675983}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Comments on "Decomposition of Permutation Networks" IS - 3 SN - 0018-9340 SP EP EPD - 265 A1 - M. Kubale, PY - 1982 KW - matrix decomposition KW - Computer complexity KW - edge coloring VL - 31 JA - IEEE Transactions on Computers ER - | |||
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.
Index Terms:
matrix decomposition, Computer complexity, edge coloring
Citation:
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
Usage of this product signifies your acceptance of the Terms of Use.