Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
The twisted cube topology for multiprocessors: a study in network asymmetry
Journal of Parallel and Distributed Computing
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
Information Processing Letters
Reliable broadcasting in product networks
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Independent spanning trees with small depths in iterated line digraphs
Discrete Applied Mathematics
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
Broadcasting in Hypercubes with Randomly Distributed Byzantine Faults
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
The t/k-Diagnosability of the BC Graphs
IEEE Transactions on Computers
Finding Four Independent Trees
SIAM Journal on Computing
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
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
IEEE Transactions on Parallel and Distributed Systems
The Multi-Tree Approach To Reliability In Distributed Networks
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Embedding a family of meshes into twisted cubes
Information Processing Letters
Constructing edge-disjoint spanning trees in locally twisted cubes
Theoretical Computer Science
Theory of Computing Systems - Special Issue: Symposium on Parallelism in Algorithms and Architectures 2006; Guest Editors: Robert Kleinberg and Christian Scheideler
Topological properties of twisted cube
Information Sciences: an International Journal
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
Efficient unicast in bijective connection networks with the restricted faulty node set
Information Sciences: an International Journal
Constructing independent spanning trees for locally twisted cubes
Theoretical Computer Science
Hamiltonian properties of twisted hypercube-like networks with more faulty elements
Theoretical Computer Science
Theoretical Computer Science
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
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes
The Journal of Supercomputing
Construction of optimal independent spanning trees on folded hypercubes
Information Sciences: an International Journal
Hi-index | 0.00 |
Multiple independent spanning trees have applications to fault tolerance and data broadcasting in distributed networks. There are two versions of the n independent spanning trees conjecture. The vertex (edge) conjecture is that any n-connected (n-edge-connected) graph has n vertex-independent spanning trees (edge-independent spanning trees) rooted at an arbitrary vertex. Note that the vertex conjecture implies the edge conjecture. The vertex and edge conjectures have been confirmed only for n-connected graphs with n@?4, and they are still open for arbitrary n-connected graph when n=5. In this paper, we confirm the vertex conjecture (and hence also the edge conjecture) for the n-dimensional twisted cube TQ"n by providing an O(NlogN) algorithm to construct n vertex-independent spanning trees rooted at any vertex, where N denotes the number of vertices in TQ"n. Moreover, all independent spanning trees rooted at an arbitrary vertex constructed by our construction method are isomorphic and the height of each tree is n+1 for any integer n=2.