Optimal parallel routing in star graphs Conference Paper uri icon

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

published proceedings

  • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

author list (cited authors)

  • Chen, C., & Chen, J.

citation count

  • 1

complete list of authors

  • Chen, Chi-Chang||Chen, Jianer

publication date

  • December 1997