"Finding a Routing Path of Optimal Length in Hypercubes with Fault Clusters."

Qian-Ping Gu, Shietung Peng (1995)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2004-07-14

- no documents available
- export record
  dblp key:
  - conf/pdpcs/GuP95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pdpcs/GuP95
Qian-Ping Gu, Shietung Peng:
Finding a Routing Path of Optimal Length in Hypercubes with Fault Clusters. Parallel and Distributed Computing and Systems 1995: 229-233

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.