Abstract
Star graphs, as discussed in [1], are considered to be attractive alternatives for hypercubes. In this paper, we discuss optimal data exchange algorithms for star graphs of small dimension ( n ≤ 6). In particular we study odd-distance and total exchange algorithms, using the tabular method introduced in [2]. The algorithms use no intermediate buffering of messages.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
