DocumentCode
276246
Title
Characterization of node disjoint (parallel) path in star graphs
Author
Jwo, Jung-Sing ; Lakshmivarahan, S. ; Dhall, S.K.
Author_Institution
Parallel Process. Inst., Oklahoma Univ., Norman, OK, USA
fYear
1991
fDate
30 Apr-2 May 1991
Firstpage
404
Lastpage
409
Abstract
This paper presents an analysis that leads to the complete characterization of the node disjoint (parallel) paths in a star graph. It is shown that by exploiting the cycle structure of permutations (same as the conjugacy class) one can decentralize a routing algorithm for transfer of packets between a pair of nodes in these graphs
Keywords
multiprocessor interconnection networks; parallel architectures; conjugacy class; cycle structure; node disjoint characterisation; parallel architecture; parallel path; permutations; star graphs; Algorithm design and analysis; Computer networks; Computer science; Concurrent computing; Graph theory; Greedy algorithms; Parallel architectures; Parallel processing; Routing; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Symposium, 1991. Proceedings., Fifth International
Conference_Location
Anaheim, CA
Print_ISBN
0-8186-9167-0
Type
conf
DOI
10.1109/IPPS.1991.153811
Filename
153811
Link To Document