• DocumentCode
    759113
  • Title

    Necessary and sufficient conditions for rearrangeable Logd(N,m,p)

  • Author

    Hwang, Frank K. ; Lin, Wen-Dar

  • Author_Institution
    Dept. of Appl. Math., Nat. Chiao Tung Univ., Hsinchu, Taiwan
  • Volume
    53
  • Issue
    12
  • fYear
    2005
  • Firstpage
    2020
  • Lastpage
    2023
  • Abstract
    We extend previous results on sufficient conditions for rearrangeable Log2(N,m,p) networks to Logd(N,m,p) networks. We show that the original argument using path-intersecting graphs cannot be extended to d>2, and we give a new argument. Further, we show our sufficient conditions are also necessary.
  • Keywords
    graph theory; multistage interconnection networks; banyan networks; path-intersecting graphs; rearrangeable networks; Bipartite graph; Communications Society; Councils; Information science; Mathematics; Mirrors; Stacking; Sufficient conditions; Switching systems; Banyan networks; Log; rearrangeable networks;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOMM.2005.860073
  • Filename
    1556828
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=759113