ON THE COMPUTATIONAL COMPLEXITY OF ROUTING IN FAULTY K-ARY N-CUBES AND HYPERCUBES release_qr45lgw4brdshgqz7awtuowsca

by IAIN A. STEWART

Published in Parallel Processing Letters by World Scientific Pub Co Pte Lt.

2012   Volume 22, Issue 01, p1250003

Archived Files and Locations

application/pdf  163.6 kB
file_ypfeke62grd27fk73asexepbs4
community.dur.ac.uk (web)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Year   2012
Language   en ?
Container Metadata
Not in DOAJ
In Keepers Registry
ISSN-L:  0129-6264
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: cfe2cb22-abb9-48b8-a626-20b8af8ad609
API URL: JSON