S. M. Rezazad

Learn More
We present a fault tolerant routing algorithm for the star graph. The algorithm is based on the concept of unsafety vectors originally proposed for binary n-cubes [J. Al-Sadi et al., (2002)]. Each node starts by computing a first level unsafely set, composed of the set of unreachable neighbours. lt then performs some exchanges with its neighbours to(More)
  • 1