An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube

Ke Qiu. An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube. In 14th International Conference on Parallel and Distributed Systems (ICPADS 2008), December 8-10, 2008, Melbourne, Victoria, Australia. pages 43-47, IEEE, 2008. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.