Communications of the ACM - Special section on computer architecture
Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
The iPSC/2 direct-connect communications technology
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
Parallel computation: models and methods
Parallel computation: models and methods
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
Hypercube and Distributed Computers: Proceedings of the First European Workshop, Rennes, France, 4-6 Oct., 1989
IEEE Transactions on Computers
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Hyper hamiltonian laceability on edge fault star graph
Information Sciences: an International Journal
Node-pancyclicity and edge-pancyclicity of hypercube variants
Information Processing Letters
Hamiltonian laceability of bubble-sort graphs with edge faults
Information Sciences: an International Journal
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science
A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM* model
Computers & Mathematics with Applications
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Sciences: an International Journal
Edge-bipancyclicity of a hypercube with faulty vertices and edges
Discrete Applied Mathematics
Edge-fault-tolerant bipanconnectivity of hypercubes
Information Sciences: an International Journal
Long paths in hypercubes with conditional node-faults
Information Sciences: an International Journal
Constructing edge-disjoint spanning trees in locally twisted cubes
Theoretical Computer Science
Conditional Edge-Fault Hamiltonicity of Matching Composition Networks
IEEE Transactions on Parallel and Distributed Systems
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
Constructing Independent Spanning Trees for Hypercubes and Locally Twisted Cubes
ISPAN '09 Proceedings of the 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks
Embedding meshes into locally twisted cubes
Information Sciences: an International Journal
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
Information Sciences: an International Journal
Conditional connectivity of star graph networks under embedding restriction
Information Sciences: an International Journal
Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
Theoretical Computer Science
Hamiltonian properties of honeycomb meshes
Information Sciences: an International Journal
| Hi-index | 0.07 |
The n-dimensional locally twisted cube LTQ"n is a new variant of the hypercube, which possesses some properties superior to the hypercube. This paper investigates the fault-tolerant edge-pancyclicity of LTQ"n, and shows that if LTQ"n (n=3) contains at most n-3 faulty vertices and/or edges then, for any fault-free edge e and any integer @? with 6=