Abstract
In this paper we fully characterize node-disjoint (parallel) paths in arrangement graph interconnection networks which have been presented as generalized star graphs for interconnecting large multiprocessor systems. We characterize complete families of parallel paths between any two nodes of an arrangement graph. The length of each path is at most four plus the minimum distance between the two nodes.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 33-48 |
| Number of pages | 16 |
| Journal | Kuwait Journal of Science and Engineering |
| Volume | 25 |
| Issue number | 1 |
| State | Published - 1998 |
Fingerprint
Dive into the research topics of 'Characterization of parallel paths in arrangement graphs'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS