• DocumentCode
    2906751
  • Title

    Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges

  • Author

    Xiang, Yonghong ; Stewart, Iain ; Madelaine, Florent

  • Author_Institution
    Sch. of Eng. & Comput. Sci., Durham Univ., Durham, UK
  • fYear
    2011
  • fDate
    7-9 Dec. 2011
  • Firstpage
    181
  • Lastpage
    187
  • Abstract
    Let u and v be any two given nodes in a k-ary n-cube Qnk with at most 2n-2 faulty edges. Suppose that the number of healthy links incident with u is no more than that of v, and denote this number by m. In this paper, we show that there are m mutually node-disjoint paths between u and v.
  • Keywords
    graph theory; faulty edge; healthy links incident; k-ary n-cubes; mutually node-disjoint path; node-to-node disjoint path; Conferences; Educational institutions; Indexes; Parallel machines; Parallel processing; Program processors; Routing; disjoint paths; fault tolerance; interconnection networks; k-ary n-cube;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Systems (ICPADS), 2011 IEEE 17th International Conference on
  • Conference_Location
    Tainan
  • ISSN
    1521-9097
  • Print_ISBN
    978-1-4577-1875-5
  • Type

    conf

  • DOI
    10.1109/ICPADS.2011.85
  • Filename
    6121276
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2906751