An O(N^1.695) Permutation Routing Algorithm on Augmented Data Manipulators
Loading...
Date
Author(s)
Citation for Previous Publication
Link to Related Item
Abstract
Description
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
Item Type
http://purl.org/coar/resource_type/c_93fc
Alternative
Other License Text / Link
Language
en