Abstract:
In a hypercube or a star graph, given an unknown number of nodes located at unknown positions each intending to broadcast a message, we propose an efficient routing algor...Show MoreMetadata
Abstract:
In a hypercube or a star graph, given an unknown number of nodes located at unknown positions each intending to broadcast a message, we propose an efficient routing algorithm to solve this problem using asymptotically optimal or near-optimal transmission time.
Published in: Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing
Date of Conference: 12-12 December 1997
Date Added to IEEE Xplore: 06 August 2002
Print ISBN:0-7803-4229-1
