Constructing One-to-Many Disjoint Paths in Folded Hypercubes
IEEE Transactions on Computers
Complexity of pairwise shortest path routing in the grid
Theoretical Computer Science
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Strong Rabin numbers of folded hypercubes
Theoretical Computer Science
Short containers in Cayley graphs
Discrete Applied Mathematics
On Disjoint Shortest Paths Routing on the Hypercube
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
One-to-many node-disjoint paths in (n,k)-star graphs
Discrete Applied Mathematics
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
Theoretical Computer Science
Many-to-Many disjoint path covers in a graph with faulty elements
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
One-to-many node-disjoint paths of hyper-star networks
Discrete Applied Mathematics
| Hi-index | 0.01 |