Characterization of parallel paths in arrangement graphs

Khaled Day, Anand Tripathi

Research output: Contribution to journalArticle

5 Citations (Scopus)

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
Pages (from-to)33-48
Number of pages16
JournalKuwait Journal of Science and Engineering
Volume25
Issue number1
Publication statusPublished - 1998

Fingerprint

Stars

ASJC Scopus subject areas

  • General

Cite this

Characterization of parallel paths in arrangement graphs. / Day, Khaled; Tripathi, Anand.

In: Kuwait Journal of Science and Engineering, Vol. 25, No. 1, 1998, p. 33-48.

Research output: Contribution to journalArticle

@article{5fe9959431814315acd249f22fd64b69,
title = "Characterization of parallel paths in arrangement graphs",
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.",
author = "Khaled Day and Anand Tripathi",
year = "1998",
language = "English",
volume = "25",
pages = "33--48",
journal = "Kuwait Journal of Science and Engineering",
issn = "1024-8684",
publisher = "Kuwait University",
number = "1",

}

TY - JOUR

T1 - Characterization of parallel paths in arrangement graphs

AU - Day, Khaled

AU - Tripathi, Anand

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=3142562661&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3142562661&partnerID=8YFLogxK

M3 - Article

VL - 25

SP - 33

EP - 48

JO - Kuwait Journal of Science and Engineering

JF - Kuwait Journal of Science and Engineering

SN - 1024-8684

IS - 1

ER -