constructing node-disjoint routes in k-ary n-cubes
Clicks: 126
ID: 235920
1997
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Star Article
30.0
/100
126 views
15 readers
AI Quality Assessment
Not analyzed
Readership in this journal
StarRanked #31 of 42 articles by views in case reports in oncological medicine
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
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 result to build a complete set of parallel paths (i.e., as many paths as the degree of the network) between any two nodes of a k-ary n-cube which can be viewed as the Cartesian product of complete graphs. Each of the constructed paths is of length at most 2 plus the minimum distance between the two nodes. These parallel paths are useful in speeding-up the transfer of large amounts of data between two nodes and in offering alternate routes in cases of faulty nodes.
| Reference Key |
day1997sultanconstructing
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Khaled Day;Abdel Elah Al-Ayyoub |
| Journal | case reports in oncological medicine |
| Year | 1997 |
| DOI |
10.24200/squjs.vol3iss0pp41-45
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.