An Efficient Shortest Path Routing on the Hypercube with Blocking/Faulty Nodes

Mehrdad Arabpour Niasari, Ke Qiu. An Efficient Shortest Path Routing on the Hypercube with Blocking/Faulty Nodes. In Sixth International Symposium on Computing and Networking, CANDAR 2018, Takayama, Japan, November 23-27, 2018. pages 39-46, IEEE Computer Society, 2018. [doi]

Abstract

Abstract is missing.