• DocumentCode
    293693
  • Title

    Vertex-disjoint routings in star graphs

  • Author

    Chen, Chi-Chang ; Chen, Jianer

  • Author_Institution
    Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
  • Volume
    1
  • fYear
    1995
  • fDate
    19-21 Apr 1995
  • Firstpage
    460
  • Abstract
    We show the necessary and sufficient condition for any two nodes in an n-dimensional star graph to have n-1 vertex-disjoint paths with length less than or equal to the minimum distance plus 2. We also provide an algorithm to generate these n-1 vertex-disjoint paths
  • Keywords
    graph theory; multiprocessor interconnection networks; parallel algorithms; interconnection network; star graphs; symmetric properties; vertex-disjoint paths; vertex-disjoint routings; Algorithm design and analysis; Computer science; Hypercubes; Routing; Sufficient conditions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Algorithms and Architectures for Parallel Processing, 1995. ICAPP 95. IEEE First ICA/sup 3/PP., IEEE First International Conference on
  • Conference_Location
    Brisbane, Qld.
  • Print_ISBN
    0-7803-2018-2
  • Type

    conf

  • DOI
    10.1109/ICAPP.1995.472218
  • Filename
    472218
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=293693