Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Qian-Ping Gu, Shietung Peng. An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters. Comput. J., 39(1):14-19, 1996.
Possibly Related PublicationsThe following publications are possibly variants of this publication: Routing in Hypercubes with Large Number of Faulty NodesQian-Ping Gu, Shietung Peng. icpads 1998: 718 [doi] Node-to-Node Cluster Fault Tolerant Routing in HypercubesQian-Ping Gu, Shietung Peng. ispan 1997: 404-409 [doi] Optimal Algorithms for Node-to-Node Fault Tolerant Routing in HypercubesQian-Ping Gu, Shietung Peng. cj, 39(7):626-629, 1996. Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in HypercubesQian-Ping Gu, Shietung Peng. pc, 24(8):1245-1261, 1998.
The following publications are possibly variants of this publication: