This paper divides the vertex set into several disjoined subsets and provides an optimal fault-tolerance routing algorithm based on the vertex set partition. This algorithm is efficient and convergent, in polynomial t...This paper divides the vertex set into several disjoined subsets and provides an optimal fault-tolerance routing algorithm based on the vertex set partition. This algorithm is efficient and convergent, in polynomial time, we can get the output if the vertex is given.展开更多
基金This project is supported by National Natural Science Foundation of Chins （10371049） and Science Foundation of Three Gorges University
文摘This paper divides the vertex set into several disjoined subsets and provides an optimal fault-tolerance routing algorithm based on the vertex set partition. This algorithm is efficient and convergent, in polynomial time, we can get the output if the vertex is given.
