Diagnosability of t-Connected Networks and Product Networks under the Comparison Diagnosis Model
IEEE Transactions on Computers
Conditional Diagnosability Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
(t,k)-Diagnosis for Matching Composition Networks
IEEE Transactions on Computers
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model
IEEE Transactions on Computers
Edge-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences: an International Journal
Efficient Fault Identification of Diagnosable Systems under the Comparison Model
IEEE Transactions on Computers
Strong diagnosability of regular networks under the comparison model
Information Processing Letters
The two-equal-disjoint path cover problem of Matching Composition Network
Information Processing Letters
On conditional diagnosability and reliability of the BC networks
The Journal of Supercomputing
Generalized matching networks and their properties
International Journal of Parallel, Emergent and Distributed Systems
Conditional diagnosability of hypercubes under the comparison diagnosis model
Journal of Systems Architecture: the EUROMICRO Journal
Minimum neighborhood in a generalized cube
Information Processing Letters
Conditional diagnosability of matching composition networks under the PMC model
IEEE Transactions on Circuits and Systems II: Express Briefs
A survey of comparison-based system-level diagnosis
ACM Computing Surveys (CSUR)
Determining the conditional diagnosability of k-ary n-cubes under the MM* model
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Theoretical Computer Science
Theoretical Computer Science
Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
Strong matching preclusion under the conditional fault model
Discrete Applied Mathematics
Conditional diagnosability of balanced hypercubes under the MM∗ model
The Journal of Supercomputing
Adaptive system-level diagnosis for hypercube multiprocessors using a comparison model
Information Sciences: an International Journal
| Hi-index | 15.00 |
The classical problem of diagnosability is discussed widely and the diagnosability of many well-known networks has been explored. We consider the diagnosability of a family of networks, called the matching composition network (MCN); a perfect matching connects two components. The diagnosability of MCN under the comparison model is shown to be one larger than that of the component, provided some connectivity constraints are satisfied. Applying our result, the diagnosability of the hypercube Qn, the crossed cube CQn, the twisted cube TQn, and the Mobius cube MQn can all proven to be n, for n≥4. In particular, we show that the diagnosability of the four-dimensional hypercube Q4 is 4, which is not previously known.