Constructing independent spanning trees for hypercubes and locally twisted cubes

檔案

本條目沒有附加檔案。

日期

2009

類型

期刊名稱

2009 10TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS, AND NETWORKS (ISPAN 2009)

卷期與頁次

頁 17–22

ISBN

978-1-4244-5403-7

語言

英文

摘要

Multiple independent spanning trees (ISTs) have applications to fault-tolerant and data broadcasting in interconnections. Thus the designs of multiple ISTs in several classes of networks have been widely investigated. There are two versions of the n ISTs conjecture. The vertex (edge,) conjecture is that any n-connected (n-edge-connected) graph has n vertex-ISTs (edge-ISTs) rooted at an arbitrary vertex r. Note that the vertex conjecture implies the edge conjecture. Recently, Hsieh and Tu proposed an algorithm to construct n edge-ISTs rooted at vertex 0 for the n-dimensional locally twisted cube (LTQ(n)), which is a variant of the n-dimensional hypercube (Q(n)). Since LTQ(n) is not vertex-transitive, Hsieh and Tu's result does not solve the edge conjecture for LTQ(n). In the paper we confirm the vertex conjecture (and hence also the edge conjecture) for LTQ(n) by proposing an algorithm to construct n vertex-ISTs rooted at any vertex. We also confirm the vertex (and also the edge) conjecture for Q(n). To the best of our knowledge, our algorithm is the first algorithm that can construct n vertex-ISTs rooted at any vertex for both LTQ(n) and Q(n).

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Liu, Y.-J., Chou, W. Y., Lan, J. K., & Chen, C. (2009). Constructing independent spanning trees for hypercubes and locally twisted cubes. 2009 10TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS, AND NETWORKS (ISPAN 2009), 17–22. https://ir.lib.nycu.edu.tw/handle/11536/14479

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/14479