The multi-tree approach to reliability in distributed networks
Information and Computation
Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
SIAM Journal on Computing
Reliable broadcasting in product networks
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Independent spanning trees of chordal rings
Information Processing Letters
Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
Information Sciences: an International Journal
Embedding k(n - k) edge-disjoint spanning trees in arrangement graphs
Journal of Parallel and Distributed Computing
Graph Theory With Applications
Graph Theory With Applications
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
Panconnectivity and edge-pancyclicity of 3-ary N-cubes
The Journal of Supercomputing
The pancyclicity and the Hamiltonian-connectivity of the generalized base-b hypercube
Computers and Electrical Engineering
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
Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links
Information Sciences: an International Journal
Independent Spanning Trees on Multidimensional Torus Networks
IEEE Transactions on Computers
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
Construction of optimal independent spanning trees on folded hypercubes
Information Sciences: an International Journal
| Hi-index | 0.89 |
A set of k spanning trees rooted at the same vertex r in a graph G is said to be independent if for each vertex x other than r, the k paths from r to x, one path in each spanning tree, are internally disjoint. Using independent spanning trees (ISTs) one can design fault-tolerant broadcasting schemes and increase message security in a network. Thus, the problem of ISTs on graphs has been received much attention. Recently, Yang et al. proposed a parallel algorithm for generating optimal ISTs on the hypercube. In this paper, we propose a similar algorithm for generating optimal ISTs on Cartesian product of complete graphs. The algorithm can be easily implemented in parallel or distributed systems. Moreover, the proof of its correctness is simpler than that of Yang et al.