Optimal parallel routing in star graphs
Conference Paper
Overview
Research
Identity
Additional Document Info
Other
View All
Overview
abstract
Star graphs have been recently proposed as attractive alternatives to the popular hypercube for interconnecting processors on a parallel computer. In this paper, we present an efficient algorithm that constructs an optimal parallel routing in star graphs. Our result improves previous results for the problem.
name of conference
Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings