Constructing edge-disjoint spanning trees in locally twisted cubes

被引：73
|
作者：
Hsieh, Sun-Yuan [1 ]
Tu, Chang-Jen [1 ]
机构：
[1] Natl Cheng Kung Univ, Dept Comp Sci & Informat Engn, Tainan 70101, Taiwan
来源：
THEORETICAL COMPUTER SCIENCE | 2009年 / 410卷 / 8-10期
关键词：
Data broadcasting; Design and analysis of algorithms; Edge-disjoint spanning trees; Graph-theoretic interconnection networks; Locally twisted cubes; ARRANGEMENT GRAPHS; INDEPENDENT TREES; HYPERCUBES;
D O I：
10.1016/j.tcs.2008.12.025
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The use of edge-disjoint spanning trees for data broadcasting and scattering problem in networks provides a number of advantages, including the increase of bandwidth and fault-tolerance. In this paper, we present an algorithm for constructing n edge-disjoint spanning trees in an n-dimensional locally twisted cube. Since the n-dimensional locally twisted cube is regular with the common degree n, the number of constructed trees is optimal. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：926 / 932
页数：7
相关论文
共 50 条
  • [1] Constructing edge-disjoint spanning trees in twisted cubes
    Yang, Ming-Chien
    [J]. INFORMATION SCIENCES, 2010, 180 (20) : 4075 - 4083
  • [2] Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
    Lin, Jia-Cian
    Yang, Jinn-Shyong
    Hsu, Chiun-Chieh
    Chang, Jou-Ming
    [J]. INFORMATION PROCESSING LETTERS, 2010, 110 (10) : 414 - 419
  • [3] Constructing edge-disjoint spanning trees in product networks
    Ku, SC
    Wang, BF
    Hung, TK
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2003, 14 (03) : 213 - 221
  • [4] Constructing independent spanning trees for locally twisted cubes
    Liu, Yi-Jiun
    Lan, James K.
    Chou, Well Y.
    Chen, Chiuyuan
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (22) : 2237 - 2252
  • [5] Embedding mutually edge-disjoint cycles into locally twisted cubes
    Cheng, Dongqin
    [J]. THEORETICAL COMPUTER SCIENCE, 2022, 929 : 11 - 17
  • [6] Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
    Hung, Ruo-Wei
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (35) : 4747 - 4753
  • [7] Embedding Three Edge-Disjoint Hamiltonian Cycles into Locally Twisted Cubes
    Pai, Kung-jui
    [J]. COMPUTING AND COMBINATORICS (COCOON 2021), 2021, 13025 : 367 - 374
  • [8] Constructing independent spanning trees for hypercubes and locally twisted cubes
    Liu, Yi-Jiun
    Chou, Well Y.
    Lan, James K.
    Chen, Chiuyuan
    [J]. 2009 10TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS, AND NETWORKS (ISPAN 2009), 2009, : 17 - 22
  • [9] Edge-disjoint spanning trees and eigenvalues
    Liu, Qinghai
    Hong, Yanmei
    Lai, Hong-Jian
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 444 : 146 - 151
  • [10] A property on edge-disjoint spanning trees
    Lai, HJ
    Lai, HY
    Payan, C
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 1996, 17 (05) : 447 - 450
12345