An O(N^1.695) Permutation Routing Algorithm on Augmented Data Manipulators

• Author(s) / Creator(s)

  • 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

• Date created

  1997

• Subjects / Keywords

  • Polynomial time algorithm
  • O(N^1.695) time algorithm
  • Augmented Data Manipulator networks

• Type of Item

  Report

• DOI

  https://doi.org/10.7939/R3S17SV8K

• License

  Attribution 3.0 International