A Group-Theoretic Model for Symmetric Interconnection Networks
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
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Information Processing Letters
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Congestion-free embedding of 2 (n-k) spanning trees in an arrangement graph
Journal of Systems Architecture: the EUROMICRO Journal
Embedding of Cycles in Arrangement Graphs
IEEE Transactions on Computers
Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance
IEEE Transactions on Computers
Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees
IEEE Transactions on Computers
Embedding Hamiltonian Paths in Faulty Arrangement Graphs with the Backtracking Method
IEEE Transactions on Parallel and Distributed Systems
Constructing edge-disjoint spanning trees in locally twisted cubes
Theoretical Computer Science
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
Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
Information Processing Letters
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
Discrete Applied Mathematics
Construction of optimal independent spanning trees on folded hypercubes
Information Sciences: an International Journal
| Hi-index | 0.00 |
The arrangement graphs are a class of generalized star graphs. In this paper we construct a graph that consists of the maximum number of directed edge-disjoint spanning trees in an arrangement graph. The paths that connect the common root node to any given node through different spanning trees are node-disjoint, and the lengths of these paths differ from the shortest possible lengths by a small additive constant. This graph can be used to derive fault-tolerant algorithms for broadcasting and scattering problems without prior knowledge of the faulty elements of the network.