A New Family of Cayley Graph Interconnection Networks of Constant Degree Four
IEEE Transactions on Parallel and Distributed Systems
Sep: A Fixed Degree Regular Network for MassivelyParallel Systems
The Journal of Supercomputing
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Embedding of Cycles in Arrangement Graphs
IEEE Transactions on Computers
Embedding Hamiltonian Paths in Faulty Arrangement Graphs with the Backtracking Method
IEEE Transactions on Parallel and Distributed Systems
On the topological properties of the arrangement-star network
Journal of Systems Architecture: the EUROMICRO Journal
Node-ranking schemes for the star networks
Journal of Parallel and Distributed Computing
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
Embedding k(n - k) edge-disjoint spanning trees in arrangement graphs
Journal of Parallel and Distributed Computing
Journal of Systems Architecture: the EUROMICRO Journal
Composition and distribution of resources for real-time computing systems
Automation and Remote Control
Hamiltonicity and colorings of arrangement graphs
Discrete Applied Mathematics
OTIS-star an attractive alternative network
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Conditional fault Hamiltonicity of the complete graph
Information Processing Letters
Note: The Independence Number for De Bruijn networks and Kautz networks
Discrete Applied Mathematics
Constructing edge-disjoint spanning trees in locally twisted cubes
Theoretical Computer Science
Automation and Remote Control
Constructing edge-disjoint spanning trees in twisted cubes
Information Sciences: an International Journal
The number of shortest paths in the (n, k)-star graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Wirelength of 1-fault hamiltonian graphs into wheels and fans
Information Processing Letters
Conditional matching preclusion for the arrangement graphs
Theoretical Computer Science
Conditional fault tolerance of arrangement graphs
Information Processing Letters
Efficient grid on the OTIS-Arrangment network
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Hamiltonian connectivity of 2-tree-generated networks
Mathematical and Computer Modelling: An International Journal
The paths embedding of the arrangement graphs with prescribed vertices in given position
Journal of Combinatorial Optimization
The number of shortest paths in the arrangement graph
Information Sciences: an International Journal
Fault diagnosability of arrangement graphs
Information Sciences: an International Journal
The edge-centered surface area of the arrangement graph
Journal of Combinatorial Optimization
Hi-index | 0.91 |