Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

93

NETWORKS
2010

133views Computer Networks» more NETWORKS 2010»

Optimal permutation routing for low-dimensional hypercubes

15 years 1 months ago

Optimal permutation routing for low-dimensional hypercubes

Download www.cs.tufts.edu

Ambrose Kofi Laing, David W. Krumme

Real-time Traffic

Computer Networks | NETWORKS 2010 |

claim paper

Related Content

» Almost optimal permutation routing on hypercubes

» Some permutation routing algorithms for lowdimensional hypercubes

» From AAPC Algorithms to High Performance Permutation Routing and Sorting

Post Info
More Details (n/a)

Added	29 Jan 2011
Updated	29 Jan 2011
Type	Journal
Year	2010
Where	NETWORKS
Authors	Ambrose Kofi Laing, David W. Krumme

Comments (0)