"An efficient shortest path routing on the hypercube with blocking/faulty ..."

Mehrdad Arabpour Niasari, Ke Qiu (2021)

> Home

Details and statistics

DOI: 10.1002/CPE.6124

access: closed

type: Journal Article

metadata version: 2022-11-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/concurrency/NiasariQ21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/concurrency/NiasariQ21
Mehrdad Arabpour Niasari, Ke Qiu:
An efficient shortest path routing on the hypercube with blocking/faulty nodes. Concurr. Comput. Pract. Exp. 33(12) (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.