IEEE Transactions on Computers
A unified approach to off-line permutation routing on parallel networks
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimal Broadcasting on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Incomplete Star: An Incrementally Scalable Network Based on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Matrix Decomposition on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Optimal Parallel Routing in Star Networks
IEEE Transactions on Computers
Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs
IEEE Transactions on Parallel and Distributed Systems
On the VLSI Area and Bisection Width of Star Graphs and Hierarchical Cubic Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Node-ranking schemes for the star networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
An enumeration of star graphs is given which has many useful properties. For example an arbitrary prefix or suffix is connected; indeed the diameter is $O(n)$. As a consequence, there is an $O(n)$ interval broadcast algorithm. Prefixes which have $t(n-1)!$ vertices for some $t$ are especially well-behaved. The topology of, embeddings in, and algorithms for these graphs are considered, making use of the enumeration.Index Terms驴Interconnection network, star graph, incomplete star graph, interval broadcast, Hamiltonian cycles.