Communications of the ACM - Special section on computer architecture
On computing a conditional edge-connectivity of a graph
Information Processing Letters
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Network Resilience: A Measure of Network Fault Tolerance
IEEE Transactions on Computers
Combinatorial Analysis of the Fault-Diameter of the N-Cube
IEEE Transactions on Computers
Graph Theory With Applications
Graph Theory With Applications
Fault Tolerance Measures for m-Ary n-Dimensional Hypercubes Based on Forbidden Faulty Sets
IEEE Transactions on Computers
Unicast in Hypercubes with Large Number of Faulty Nodes
IEEE Transactions on Parallel and Distributed Systems
Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results
IEEE Transactions on Computers
Combinatorial Analysis of the Fault-Diameter of the N-Cube
IEEE Transactions on Computers
Methods for distributed unicast in hypercubes
Journal of Systems Architecture: the EUROMICRO Journal
Conditional Diagnosability Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
On computing conditional fault-tolerance measures for k-covered wireless sensor networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Highly fault-tolerant cycle embeddings of hypercubes
Journal of Systems Architecture: the EUROMICRO Journal
Fault tolerance measures for large-scale wireless sensor networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Conditional fault diameter of crossed cubes
Journal of Parallel and Distributed Computing
Long paths in hypercubes with conditional node-faults
Information Sciences: an International Journal
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
Information Sciences: an International Journal
Fault-free longest paths in star networks with conditional link faults
Theoretical Computer Science
λc-Optimally half vertex transitive graphs with regularity k
Information Processing Letters
Fault-tolerant routing in mesh-connected 2D tori
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
A kind of conditional fault tolerance of alternating group graphs
Information Processing Letters
A kind of conditional fault tolerance of (n,k)-star graphs
Information Processing Letters
Conditional connectivity of Cayley graphs generated by transposition trees
Information Processing Letters
Cyclic vertex connectivity of star graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
Information Sciences: an International Journal
Conditional fault tolerance of arrangement graphs
Information Processing Letters
Super cyclically edge connected transitive graphs
Journal of Combinatorial Optimization
Upper bounds on the connection probability for 2-D meshes and tori
Journal of Parallel and Distributed Computing
Edge-bipancyclicity of all conditionally faulty hypercubes
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Conditional connectivity of star graph networks under embedding restriction
Information Sciences: an International Journal
Extraconnectivity of k-ary n-cube networks
Theoretical Computer Science
{2,3}-Extraconnectivities of hypercube-like networks
Journal of Computer and System Sciences
Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
Generalized measures of fault tolerance in exchanged hypercubes
Information Processing Letters
Super-cyclically edge-connected regular graphs
Journal of Combinatorial Optimization
Conditional diagnosability of balanced hypercubes under the MM∗ model
The Journal of Supercomputing
Edge-fault tolerance of hypercube-like networks
Information Processing Letters
Discrete Applied Mathematics
Fault-tolerant cycle embedding in the faulty hypercubes
Information Sciences: an International Journal
| Hi-index | 15.00 |
Introduces a new measure of conditional connectivity for large regular graphs by requiring each vertex to have at least g good neighbors in the graph. Based on this requirement, the vertex connectivity for the n-dimensional cube is obtained, and the minimal sets of faulty nodes that disconnect the cube are characterized.