JF Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on

YR 1997

VO 00

IS

SP 91

TI The shortest routing path in star graphs with faulty clusters

A1 Qian-Ping Gu,

A1 Shientung Peng,

K1 graph theory; shortest routing path; star graphs; faulty clusters; connected subgraph; faulty nodes; nonfaulty nodes; fault-free path; optimal path length

AB Given a graph G, a cluster C is a connected subgraph of G, and C is called a faulty cluster if all nodes in C are faulty. Given an n-dimensional star graph G/sub n/ with n-2 faulty clusters of diameter at most 2, it has been shown by the authors (1994) that any two non-faulty nodes s and t of G/sub n/ can be connected by a fault-free path of length at most d(G/sub n/)+6 in O(n/sup 2/) time, where d(G/sub n/)=[(3(n-1))/2] is the diameter of G/sub n/. In this paper, we prove that a fault-free path s/spl rarr/t of length at most d(G/sub n/)+1 if n>10 or n is odd, or d(G/sub n/)+2 otherwise, can be found in O(n/sup 2/) time. The length of the path s/spl rarr/t is optimal.

PB IEEE Computer Society, [URL:http://www.computer.org]

SN

LA English

DO 10.1109/AISPAS.1997.581636

LK http://doi.ieeecomputersociety.org/10.1109/AISPAS.1997.581636