disjo相关论文
Chent等研究了n-Star网络中的点到多点并行路由问题,对前人的工作做了很大的改进,给出了一个几乎最优的时间复杂度为O(n^2)的算法,由Chen的算法所给出的n-1条路......
<正>The present paper deals with the gracefulness of unconnected graph (jC_(4n))∪P_m,and proves the following result:fo......