資料載入中.....
|
請使用永久網址來引用或連結此文件:
https://irlib.pccu.edu.tw/handle/987654321/36029
|
| 題名: | Independent Spanning Trees in RTCC-Pyramids |
| 作者: | Wang, SI (Wang, Shuo-I)
Wang, FH (Wang, Fu-Hsing) |
| 貢獻者: | 資管系 |
| 關鍵詞: | independent spanning trees
interconnection networks
RTCC-pyramids
graph algorithms |
| 日期: | 2017-01 |
| 上傳時間: | 2017-04-27 14:44:56 (UTC+8) |
| 摘要: | The independent spanning trees (ISTs) problem is asked to find k spanning trees rooted at a designated vertex r such that, for any vertex v, all paths connecting r and v in k spanning trees are pairwise internally disjoint in the given graph. ISTs have numerous applications in networks such as reliable communication protocols, data broadcasting and secure message distribution. In the past, most of the results focused on constructing k-ISTs on symmetric networks. While the existence of asymmetry makes the k-ISTs problem even harder than its symmetric counterpart, we have derived linear time algorithms for solving 3-ISTs rooted at an arbitrary vertex of recursive transpose-connected 4-cycle-pyramids. |
| 關聯: | COMPUTER JOURNAL 卷: 60 期: 1 頁碼: 13-26 |
| 顯示於類別: | [資訊管理學系暨資訊管理研究所 ] 期刊論文
|
文件中的檔案:
| 檔案 |
描述 |
大小 | 格式 | 瀏覽次數 |
|---|
| index.html | | 0Kb | HTML | 397 | 檢視/開啟 |
|
在CCUR中所有的資料項目都受到原著作權保護.
|
