Node-to-node disjoint paths in k-ary n-cubes with faulty edges.

Xiang, Y.; Stewart, I.A.; Madelaine, F.R.

Abstract

Let u and v be any two given nodes in a k-ary n-cube Qnk with at most 2n-2 faulty edges. Suppose that the number of healthy links incident with u is no more than that of v, and denote this number by m. In this paper, we show that there are m mutually node-disjoint paths between u and v.

Citation

Xiang, Y., Stewart, I., & Madelaine, F. (2012, January). Node-to-node disjoint paths in k-ary n-cubes with faulty edges. Presented at 17th International Conference on Parallel and Distributed Systems, ICPADS'11., Tainan, Taiwan

• Presentation Conference Type: Conference Paper (published)
• Conference Name: 17th International Conference on Parallel and Distributed Systems, ICPADS'11.
• Publication Date: 2012-01
• Deposit Date: Oct 5, 2011
• Publisher: Institute of Electrical and Electronics Engineers
• Pages: 181-187
• Book Title: 2011 IEEE 17th International Conference on Parallel and Distributed Systems (ICPADS 2011). Proceedings of a meeting held 7-9 December 2011, Tainan, Taiwan.
• ISBN: 9780769545769
• DOI: https://doi.org/10.1109/icpads.2011.85
• Public URL: https://durham-repository.worktribe.com/output/1158810
• Additional Information: Date of Conference: 7-9 Dec. 2011