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
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;
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
DOI :
10.1109/ICAPP.1995.472218
