Portal de Periódicos da CAPES

An Efficient Algorithm for Node-to-node Routing in Hypercubes with Faulty Clusters

1996; Oxford University Press; Volume: 39; Issue: 1 Linguagem: Inglês

10.1093/comjnl/39.1.14

1460-2067

Q.-P. Gu,

Caching and Content Delivery

Journal Article An Efficient Algorithm for Node-to-node Routing in Hypercubes with Faulty Clusters Get access Q.-P. Gu, Q.-P. Gu Department of Computer Software, The University of Aizu, Aizu-Wakamatsu, Fukushima 965-80, Japan Search for other works by this author on: Oxford Academic Google Scholar S. Peng S. Peng Department of Computer Software, The University of Aizu, Aizu-Wakamatsu, Fukushima 965-80, Japan Search for other works by this author on: Oxford Academic Google Scholar The Computer Journal, Volume 39, Issue 1, 1996, Pages 14–19, https://doi.org/10.1093/comjnl/39.1.14 Published: 01 January 1996