|
|||||
|
|
Independent spanning trees on even networks |
|
| Authors: | Jong-Seok Kim Eddie Cheng |
| Affiliation: | a Department of Information and Communication Engineering, Yeungnam University, Gyeongsan, Gyeongbuk 712-749, Republic of Korea b Department of Computer Education, Sunchon National University, Sunchon, Chonnam 540-742, Republic of Korea c Department of Mathematics and Statistics, Oakland University, Rochester, MI 48309, United States |
| Abstract: | The use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides a number of advantages, including the increase of fault-tolerance and bandwidth. Thus, the designs of multiple ISTs on several classes of networks have been widely investigated. In this paper, we give an algorithm to construct ISTs on even networks, and show that these ISTs are optimal for height and path lengths, and each path in the ISTs has length at most the length of the shortest path+4 in the even network. |
| Keywords: | Independent spanning trees Even networks Internally disjoint paths Algorithms |
| 本文献已被 ScienceDirect 等数据库收录！ | |