Characterization of parallel paths in arrangement graphs

Khaled Day, Anand Tripathi

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

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 languageEnglish (US)
Pages (from-to)33-48
Number of pages16
JournalKuwait Journal of Science and Engineering
Volume25
Issue number1
StatePublished - Dec 1 1998

Fingerprint Dive into the research topics of 'Characterization of parallel paths in arrangement graphs'. Together they form a unique fingerprint.

Cite this