Skip to main content
Conference Proceedings

Optimal parallel routing in star graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1197 LNCS 73-84
DOI: 10.1007/3-540-62559-3_8
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Chen, C. C., & Chen, J. (1997). Optimal parallel routing in star graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1197 LNCS, pp. 73–84). https://doi.org/10.1007/3-540-62559-3_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free