ERA

No preview available

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3S17SV8K

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Computing Science, Department of

Collections

This file is in the following collections:

Technical Reports (Computing Science)

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

Descriptions

Author or creator
Elmallah, Ehab
Lam, Chin-Hung
Additional contributors
Subject/Keyword
Augmented Data Manipulator networks
polynomial time algorithm
O(N^1.695) time algorithm
Type of item
Report
Language
English
Place
Time
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.
Date created
1997
DOI
doi:10.7939/R3S17SV8K
License information
Creative Commons Attribution 3.0 Unported
Rights

Citation for previous publication

Source
Link to related item

File Details

Date Uploaded
Date Modified
2014-04-28T21:21:02.286+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: postscript (Postscript)
Mime type: application/postscript
File size: 221283
Last modified: 2015:10:12 17:22:48-06:00
Filename: TR97-07.ps
Original checksum: 82acbb41d6ab46c22a4978de7496c52c
Activity of users you follow
User Activity Date