This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Communities and Collections
Usage
- 181 views
- 120 downloads
An O(N^1.695) Permutation Routing Algorithm on Augmented Data Manipulators
-
- Author(s) / Creator(s)
-
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
-
- Date created
- 1997
-
- Subjects / Keywords
-
- Type of Item
- Report
-
- License
- Attribution 3.0 International