Search
Skip to Search Results
Filter
Subject / Keyword
Author / Creator / Contributor
Year
Collections
Languages
Item type
-
An O(N^1.695) Permutation Routing Algorithm on Augmented Data Manipulators
1997
Elmallah, Ehab, Lam, Chin-Hung
Technical report TR97-07. This paper shows an O(N^1.695) time algorithm for routing any arbitrary admissible permutation on Augmented Data Manipulator networks. The devised algorithm appears to be the first known polynomial time algorithm for solving the above problem. | TRID-ID TR97-07
1 - 1 of 1