Embedding a ring in a hypercube with both faulty links and faulty nodes
Information Processing Letters
Fault-tolerant hamiltonian laceability of hypercubes
Information Processing Letters
Fault-tolerant cycle embedding in the hypercube
Parallel Computing
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Hamiltonian properties on the class of hypercube-like networks
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Longest paths and cycles in faulty star graphs
Journal of Parallel and Distributed Computing
Hamiltonian Cycles with Prescribed Edges in Hypercubes
SIAM Journal on Discrete Mathematics
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Information Processing Letters
Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
SIAM Journal on Discrete Mathematics
Graph Theory
Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
IEEE Transactions on Computers
Theory of Computing Systems - Special Issue: Symposium on Parallelism in Algorithms and Architectures 2006; Guest Editors: Robert Kleinberg and Christian Scheideler
Many-to-many disjoint paths in faulty hypercubes
Information Sciences: an International Journal
Long paths and cycles in hypercubes with faulty vertices
Information Sciences: an International Journal
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
Paired many-to-many disjoint path covers of hypercubes with faulty edges
Information Processing Letters
| Hi-index | 5.23 |
A paired many-to-many k-disjoint path cover (k-DPC for short) of a graph is a set of k disjoint paths joining k distinct source-sink pairs that cover all the vertices of the graph. Extending the notion of DPC, we define a paired many-to-many bipartite k-DPC of a bipartite graph G to be a set of k disjoint paths joining k distinct source-sink pairs that altogether cover the same number of vertices as the maximum number of vertices covered when the source-sink pairs are given in the complete bipartite, spanning supergraph of G. We show that every m-dimensional hypercube, Q"m, under the condition that f or less faulty elements (vertices and/or edges) are removed, has a paired many-to-many bipartite k-DPC joining any k distinct source-sink pairs for any f and k=1 subject to f+2k=