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
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Introduction to Algorithms
Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
SIAM Journal on Discrete Mathematics
Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
IEEE Transactions on Computers
Long paths in hypercubes with a quadratic number of faults
Information Sciences: an International Journal
Long paths and cycles in hypercubes with faulty vertices
Information Sciences: an International Journal
Computational complexity of long paths and cycles in faulty hypercubes
Theoretical Computer Science
A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance
The Journal of Supercomputing
Testing connectivity of faulty networks in sublinear time
Journal of Discrete Algorithms
| Hi-index | 0.00 |
Given a connected graph G and a set F of faulty vertices of G, let G - F be the graph obtained from G by deletion of all vertices of F and edges incident with them. Is there an algorithm, whose running time may be bounded by a polynomial function of |F| and log |V (G)|, which decides whether G-F is still connected? Even though the answer to this question is negative in general, we describe an algorithm which resolves this problem for the n-dimensional hypercube in time O(|F|n3). Furthermore, we sketch a more general algorithm that is efficient for graph classes with good vertex expansion properties.