Hamilton-connectivity and cycle-embedding of the Möbius cubes
Information Processing Letters
Embedding Graphs onto the Supercube
IEEE Transactions on Computers
Survivable Networks with Bounded Delay: The Edge Failure Case
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Discrete Applied Mathematics - Special issue: Max-algebra
Discrete Applied Mathematics
Hi-index | 0.00 |
We study the presence of cycles and long paths in graphs that have been proposed as intercon- nection networks for parallel architectures. The study surveys and complements known results.