BibTeX
CSL-JSON
MLA
Harvard
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
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links
oaDOI/unpaywall (OA fulltext)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar