Referenced Items are not available for this document.
The one-to-all personalized broadcast problem in an interconnection network can be optimally solved with respect to both the time and the number of transmissions if it is possible to construct an optimally balanced spanning tree of the network which is also a shortest path tree. We give an algorithm to construct an optimally balanced spanning tree of the star network which is also a shortest path tree. Our result is optimal and improves on that of Chen et al. (1996) and Day and Tripathi (1994)
Published in:
Computers, IEEE Transactions on
(Volume:50
,
Issue:
1
)
Date of Publication: Jan 2001
- Page(s):
- 88 - 91
- ISSN :
- 0018-9340
- INSPEC Accession Number:
- 6842611
- Digital Object Identifier :
- 10.1109/12.902755
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 07 August 2002
- Issue Date :
- Jan 2001
- Sponsored by :
- IEEE Computer Society
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
