A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
The Cost of Broadcasting on Star Graphs and k-ary Hypercubes
IEEE Transactions on Computers
Packet routing and PRAM emulation on star graphs and leveled networks
Journal of Parallel and Distributed Computing
Routing function and deadlock avoidance in a star graph interconnection network
Journal of Parallel and Distributed Computing
On some properties and algorithms for the star and pancake interconnection networks
Journal of Parallel and Distributed Computing
On the k-diameter of k-regular k-connected graphs
Discrete Mathematics
A Well-Behaved Enumeration of Star Graphs
IEEE Transactions on Parallel and Distributed Systems
An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Short length versions of Menger's theorem
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The Maximum Partition Matching Problem with Applications
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Routing and Broadcasting Scheme on Faulty Star Graphs
IEEE Transactions on Computers
Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group
IEEE Transactions on Computers
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Nearly Optimal One-to-Many Parallel Routing in Star Networks
IEEE Transactions on Parallel and Distributed Systems
Optimal Parallel Routing in Star Graphs
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
Combinatorial and algebraic methods in star and de bruijn networks
Combinatorial and algebraic methods in star and de bruijn networks
Optimally Balanced Spanning Tree of the Star Network
IEEE Transactions on Computers
Constructing One-to-Many Disjoint Paths in Folded Hypercubes
IEEE Transactions on Computers
Nearly Optimal One-to-Many Parallel Routing in Star Networks
IEEE Transactions on Parallel and Distributed Systems
Strong Fault-Tolerance: Parallel Routing in Networks with Faults
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Reliable Communication in Faulty Star Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
On Strong Menger-Connectivity of Star Graphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
On strong Menger-connectivity of star graphs
Discrete Applied Mathematics
Performance Comparison of Adaptive Routing Algorithms in the Star Network
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Short containers in Cayley graphs
Discrete Applied Mathematics
Mathematical performance modelling of stretched hypercubes
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
| Hi-index | 14.99 |
Star networks have recently been proposed as attractive alternatives to the popular hypercube for interconnecting processors on a parallel computer. In this paper, we present an efficient algorithm that constructs an optimal parallel routing in star networks. Our result improves previous results for the problem.