Cart (Loading....) | Create Account
Close category search window
 

Characterization of node disjoint (parallel) path in star graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jwo, J.-S. ; Parallel Process. Inst., Oklahoma Univ., Norman, OK, USA ; Lakshmivarahan, S. ; Dhall, S.K.

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

Published in:

Parallel Processing Symposium, 1991. Proceedings., Fifth International

Date of Conference:

30 Apr-2 May 1991

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.