Constructing edge-disjoint spanning trees in locally twisted cubes

Authors:
Sun-Yuan Hsieh;Chang-Jen Tu
Affiliations:
Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, University Road, Tainan 70101, Taiwan;Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, University Road, Tainan 70101, Taiwan
Venue:
Theoretical Computer Science
Year:
2009

Citing 12
Cited 16

The multi-tree approach to reliability in distributed networks

Information and Computation
Reliable Broadcast in Hypercube Multicomputers

IEEE Transactions on Computers
Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs

Journal of Algorithms
Optimum Broadcasting and Personalized Communication in Hypercubes

IEEE Transactions on Computers
Arrangement graphs: a class of generalized star graphs

Information Processing Letters
Independent spanning trees of chordal rings

Information Processing Letters
Congestion-free embedding of 2 (n-k) spanning trees in an arrangement graph

Journal of Systems Architecture: the EUROMICRO Journal
Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance

IEEE Transactions on Computers
Embedding k(n - k) edge-disjoint spanning trees in arrangement graphs

Journal of Parallel and Distributed Computing
Finding Four Independent Trees

SIAM Journal on Computing
Parallel construction of optimal independent spanning trees on hypercubes

Parallel Computing
Reducing the Height of Independent Spanning Trees in Chordal Rings

IEEE Transactions on Parallel and Distributed Systems

Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes

Information Processing Letters
Constructing edge-disjoint spanning trees in twisted cubes

Information Sciences: an International Journal
Embedding of tori and grids into twisted cubes

Theoretical Computer Science
Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs

Information Processing Letters
Fault-tolerant edge-pancyclicity of locally twisted cubes

Information Sciences: an International Journal
Constructing independent spanning trees for locally twisted cubes

Theoretical Computer Science
A novel algorithm to embed a multi-dimensional torus into a locally twisted cube

Theoretical Computer Science
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes

Discrete Applied Mathematics
Optimal Independent Spanning Trees on Odd Graphs

The Journal of Supercomputing
Note: Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes

Theoretical Computer Science
Independent spanning trees on twisted cubes

Journal of Parallel and Distributed Computing
Optimal broadcasting for locally twisted cubes

Information Processing Letters
An algorithm to construct independent spanning trees on parity cubes

Theoretical Computer Science
Independent spanning trees in crossed cubes

Information Sciences: an International Journal
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes

Journal of Parallel and Distributed Computing
Construction of optimal independent spanning trees on folded hypercubes

Information Sciences: an International Journal

Quantified Score

Hi-index	5.23

Visualization

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.