Fault-Tolerant Routing in DeBruijn Comrnunication Networks
IEEE Transactions on Computers
On the existence of Hamiltonian circuits in faulty hypercubes
SIAM Journal on Discrete Mathematics
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Fault-tolerant multicasting on hypercubes
Journal of Parallel and Distributed Computing
Efficient gossiping by packets in networks with random faults
SIAM Journal on Discrete Mathematics
Embedding a ring in a hypercube with both faulty links and faulty nodes
Information Processing Letters
Parallel computation: models and methods
Parallel computation: models and methods
Fault Diameter of k-ary n-cube Networks
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant hamiltonian laceability of hypercubes
Information Processing Letters
Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions
IEEE Transactions on Computers
Safety Levels-An Efficient Mechanism for Achieving Reliable Broadcasting in Hypercubes
IEEE Transactions on Computers
On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
Information Sciences—Informatics and Computer Science: An International Journal
Fault-tolerant cycle embedding in the hypercube
Parallel Computing
Hyper hamiltonian laceability on edge fault star graph
Information Sciences: an International Journal
Optimal fault-tolerant embedding of paths in twisted cubes
Journal of Parallel and Distributed Computing
On reliability of the folded hypercubes
Information Sciences: an International Journal
Hamiltonian laceability of bubble-sort graphs with edge faults
Information Sciences: an International Journal
Embedding meshes into crossed cubes
Information Sciences: an International Journal
Proof that pyramid networks are 1-Hamiltonian-connected with high probability
Information Sciences: an International Journal
Node-disjoint paths in hierarchical hypercube networks
Information Sciences: an International Journal
Conditional fault-tolerant hamiltonicity of star graphs
Parallel Computing
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
Constructing vertex-disjoint paths in (n, k)-star graphs
Information Sciences: an International Journal
Hamiltonian connectivity of the WK-recursive network with faulty nodes
Information Sciences: an International Journal
Fault-tolerant embedding of paths in crossed cubes
Theoretical Computer Science
Long paths in hypercubes with conditional node-faults
Information Sciences: an International Journal
On embedding subclasses of height-balanced trees in hypercubes
Information Sciences: an International Journal
Super p-restricted edge connectivity of line graphs
Information Sciences: an International Journal
Long paths in hypercubes with a quadratic number of faults
Information Sciences: an International Journal
Fault-Free Cycles in Conditional Faulty Folded Hypercubes
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Long paths and cycles in hypercubes with faulty vertices
Information Sciences: an International Journal
Path embeddings in faulty 3-ary n-cubes
Information Sciences: an International Journal
Two-node-Hamiltonicity of enhanced pyramid networks
Information Sciences: an International Journal
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
Computational complexity of long paths and cycles in faulty hypercubes
Theoretical Computer Science
Embedded paths and cycles in faulty hypercubes
Journal of Combinatorial Optimization
Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
Information Processing Letters
Efficient unicast in bijective connection networks with the restricted faulty node set
Information Sciences: an International Journal
Fault-tolerant edge-pancyclicity of locally twisted cubes
Information Sciences: an International Journal
Theoretical Computer Science
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
Theoretical Computer Science
Topological properties of folded hyper-star networks
The Journal of Supercomputing
One-to-many node-disjoint paths of hyper-star networks
Discrete Applied Mathematics
Long cycles in hypercubes with optimal number of faulty vertices
Journal of Combinatorial Optimization
The 2-path-bipanconnectivity of hypercubes
Information Sciences: an International Journal
Embedding certain height-balanced trees and complete pm-ary trees into hypercubes
Journal of Discrete Algorithms
Paired many-to-many disjoint path covers in faulty hypercubes
Theoretical Computer Science
| Hi-index | 0.08 |
The hypercube is one of the most versatile and efficient interconnection networks (networks for short) so far discovered for parallel computation. Let f denote the number of faulty vertices in an n-cube. This study demonstrates that when f=