Constructing Node-Disjoint Routes in K-Ary N-Cubes
In this paper, a method for constructing node-disjoint (parallel) paths in k-ary n-cube interconnection networks is described. We start by showing in general how to construct parallel paths in any Cartesian product of two graphs based on known paths in the factor graphs. Then we apply the general re...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sultan Qaboos University
1997-12-01
|
| Series: | Sultan Qaboos University Journal for Science |
| Subjects: | |
| Online Access: | https://journals.squ.edu.om/index.php/squjs/article/view/216 |