Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
The multi-tree approach to reliability in distributed networks
Information and Computation
Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
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
Fault-tolerant Hamiltonicity of twisted cubes
Journal of Parallel and Distributed Computing
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
Edge-disjoint spanning trees for the generalized butterfly networks and their applications
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Optimal fault-tolerant embedding of paths in twisted cubes
Journal of Parallel and Distributed 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
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
Theoretical Computer Science
Constructing edge-disjoint spanning trees in locally twisted cubes
Theoretical Computer Science
On the independent spanning trees of recursive circulant graphs G(cdm,d) with d2
Theoretical Computer Science
Constructing the nearly shortest path in crossed cubes
Information Sciences: an International Journal
Edge-fault-tolerant node-pancyclicity of twisted cubes
Information Processing Letters
Independent Spanning Trees on Multidimensional Torus Networks
IEEE Transactions on Computers
Topological properties of twisted cube
Information Sciences: an International Journal
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
Information Processing Letters
Embedding meshes into twisted-cubes
Information Sciences: an International Journal
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
Discrete Applied Mathematics
Independent spanning trees on twisted cubes
Journal of Parallel and Distributed Computing
An algorithm to construct independent spanning trees on parity cubes
Theoretical Computer Science
Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
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
| Hi-index | 0.07 |
The use of edge-disjoint spanning trees or independent spanning trees in a network for data broadcasting has the benefits of increased of bandwidth and fault-tolerance. In this paper, we propose an algorithm which constructs n edge-disjoint spanning trees in the n-dimensional twisted cube, denoted by TQ"n. Because the n-dimensional twisted cube is n-regular, the result is optimal with respect to the number of edge-disjoint spanning trees constructed. Furthermore, we also show that n2 of the n edge-disjoint spanning trees constructed are independent spanning trees. This algorithm runs in time O(NlogN) and can be parallelized to run in time O(logN) where N is the number of nodes in TQ"n.