Y. Xiang
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.
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 |
You might also like
Payment scheduling in the Interval Debt Model
(2023)
Presentation / Conference Contribution
An efficient shortest path routing algorithm in the data centre network DPillar
(2015)
Presentation / Conference Contribution
Routing packets on DPillar data centre networks
(2015)
Presentation / Conference Contribution
Routing algorithms for recursively-defined data centre networks
(2015)
Presentation / Conference Contribution
Accelerating ant colony optimization-based edge detection on the GPU using CUDA
(2014)
Presentation / Conference Contribution
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search