Long paths in hypercubes with conditional node-faults

Authors:
Tz-Liang Kueng;Tyne Liang;Lih-Hsing Hsu;Jimmy J. M. Tan
Affiliations:
Department of Computer Science, National Chiao Tung University, 1001 University Road, Hsinchu 30050, Taiwan, ROC;Department of Computer Science, National Chiao Tung University, 1001 University Road, Hsinchu 30050, Taiwan, ROC;Department of Computer Science and Information Engineering, Providence University, 200 Chung Chi Road, Taichung 43301, Taiwan, ROC;Department of Computer Science, National Chiao Tung University, 1001 University Road, Hsinchu 30050, Taiwan, ROC
Venue:
Information Sciences: an International Journal
Year:
2009

Citing 16
Cited 24

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
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
Conditional Connectivity Measures for Large Multiprocessor Systems

IEEE Transactions on Computers
Bipanconnectivity and edge-fault-tolerant bipancyclicity 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
Graph Theory With Applications

Graph Theory With Applications
Optimal Path Embedding in Crossed Cubes

IEEE Transactions on Parallel and Distributed Systems
Embedding meshes into crossed cubes

Information Sciences: an International Journal
Node-disjoint paths in hierarchical hypercube networks

Information Sciences: an International Journal
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes

Information Sciences: an International Journal
Edge-pancyclicity and path-embeddability of bijective connection graphs

Information Sciences: an International Journal
Longest fault-free paths in hypercubes with vertex faults

Information Sciences: an International Journal
On embedding cycles into faulty twisted cubes

Information Sciences: an International Journal

On the enhanced hyper-hamiltonian laceability of hypercubes

CEA'09 Proceedings of the 3rd WSEAS international conference on Computer engineering and applications
Many-to-many disjoint paths in faulty hypercubes

Information Sciences: an International Journal
Long paths in hypercubes with a quadratic number of faults

Information Sciences: an International Journal
Embedding paths of variable lengths into hypercubes with conditional link-faults

Parallel Computing
Long paths and cycles in hypercubes with faulty vertices

Information Sciences: an International Journal
Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links

Information Sciences: an International Journal
The triangular pyramid: Routing and topological properties

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 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
Panconnectivity of Cartesian product graphs

The Journal of Supercomputing
Paired many-to-many disjoint path covers of hypercubes with faulty edges

Information Processing Letters
Hamiltonian cycles in hypercubes with 2n-4 faulty edges

Information Sciences: an International Journal
Long cycles in hypercubes with optimal number of faulty vertices

Journal of Combinatorial Optimization
Fault-tolerant path embedding in folded hypercubes with both node and edge faults

Theoretical Computer Science
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
Embedding certain height-balanced trees and complete pm-ary trees into hypercubes

Journal of Discrete Algorithms
Fault-tolerant cycle embedding in the faulty hypercubes

Information Sciences: an International Journal
Hamiltonian cycles in hypercubes with faulty edges

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

Let F be a set of f=