Vertex-disjoint routings in star graphs Conference Paper uri icon

abstract

  • In this paper we show the necessary and sufficient condition for any two nodes in an n-dimensional star graph to have n - 1 vertex-disjoint paths with length less than or equal to the minimum distance plus 2. We also provide an algorithm to generate these n - 1 vertex-disjoint paths.

published proceedings

  • IEEE International Conference on Algorithms and Architectures for Parallel Processing

author list (cited authors)

  • Chen, C. C., & Chen, J.

complete list of authors

  • Chen, CC||Chen, J

publication date

  • January 1995