Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
436301 | Theoretical Computer Science | 2014 | 14 Pages |
Abstract
The conditional diagnosability of interconnection networks has been studied by using a number of ad-hoc methods. Recently, gathering various ad-hoc methods developed in the last decade, a unified approach was developed, and this approach was used to find the conditional diagnosability of many interconnection networks. In this paper, we study the conditional diagnosability of matching composition networks, including those that are not triangle-free.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Eddie Cheng, Ke Qiu, Zhizhang Shen,