• DocumentCode
    1145988
  • Title

    Comments on "Decomposition of Permutation Networks"

  • Author

    Kubale, M.

  • Author_Institution
    Institute of Informatics, Technical University of Gdańsk
  • Issue
    3
  • fYear
    1982
  • fDate
    3/1/1982 12:00:00 AM
  • Firstpage
    265
  • Lastpage
    265
  • 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;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1982.1675983
  • Filename
    1675983
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1145988