Data compression and Gray-code sorting
Information Processing Letters
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions
The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions
Compressing Bitmap Indices by Data Reorganization
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)
Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
SIAM Journal on Discrete Mathematics
Long paths in hypercubes with conditional node-faults
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
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
The panpositionable panconnectedness of augmented cubes
Information Sciences: an International Journal
Computational complexity of long paths and cycles in faulty hypercubes
Theoretical Computer Science
Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
Information Processing Letters
Efficient connectivity testing of hypercubic networks with faults
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Paired many-to-many disjoint path covers of hypercubes with faulty edges
Information Processing Letters
Long cycles in hypercubes with optimal number of faulty vertices
Journal of Combinatorial Optimization
Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
Information Sciences: an International Journal
The 2-path-bipanconnectivity of hypercubes
Information Sciences: an International Journal
On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
Journal of Combinatorial Optimization
| Hi-index | 0.07 |
A path between distinct vertices u and v of the n-dimensional hypercube Q"n avoiding a given set of f faulty vertices is called long if its length is at least 2^n-2f-2. We present a function @f(n)=@Q(n^2) such that if f=