Constructing edge-disjoint spanning trees in locally twisted cubes

Sun Yuan Hsieh; Chang Jen Tu

doi:10.1016/j.tcs.2008.12.025

Constructing edge-disjoint spanning trees in locally twisted cubes

Sun Yuan Hsieh, Chang Jen Tu

Department of Computer Science and Information Engineering

Research output: Contribution to journal › Article › peer-review

76 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	926-932
Number of pages	7
Journal	Theoretical Computer Science
Volume	410
Issue number	8-10
DOIs	https://doi.org/10.1016/j.tcs.2008.12.025
Publication status	Published - 2009 Mar 1

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1016/j.tcs.2008.12.025

Fingerprint Dive into the research topics of 'Constructing edge-disjoint spanning trees in locally twisted cubes'. Together they form a unique fingerprint.

Cite this

@article{197566d66b6340ea91357192d19bebae,

title = "Constructing edge-disjoint spanning trees in locally twisted cubes",

abstract = "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.",

author = "Hsieh, {Sun Yuan} and Tu, {Chang Jen}",

year = "2009",

month = mar,

day = "1",

doi = "10.1016/j.tcs.2008.12.025",

language = "English",

volume = "410",

pages = "926--932",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "8-10",

}

TY - JOUR

T1 - Constructing edge-disjoint spanning trees in locally twisted cubes

AU - Hsieh, Sun Yuan

AU - Tu, Chang Jen

PY - 2009/3/1

Y1 - 2009/3/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=59049093578&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=59049093578&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2008.12.025

DO - 10.1016/j.tcs.2008.12.025

M3 - Article

AN - SCOPUS:59049093578

VL - 410

SP - 926

EP - 932

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 8-10

ER -