Three disjoint path paradigms in star networks

Star networks have been recently proposed as an attractive choice for interconnection networks. They have sublogarithmic node degree and diameter and, like hypercubes, have a highly recursive structure. Several researchers have endeavored to prove that star networks are as versatile as hypercubes. The paper is an effort in the same direction. It presents optimal algorithms for computing disjoint paths in star graphs for two well known paradigms. It also studies the problem of disjoint connecting paths and presents an efficient algorithm for finding a limited number of such paths in the star network.<
>