g-good-neighbor conditional diagnosability of star graph networks under PMC model and MM* model

[1]  Cheng-Kuan Lin,et al.  Diagnosability Evaluation of the Data Center Network DCell , 2018, Comput. J..

[2]  Shiying Wang,et al.  The g-good-neighbor conditional diagnosability of n-dimensional hypercubes under the MM⁎ model , 2016, Inf. Process. Lett..

[3]  Cheng-Kuan Lin,et al.  The restricted h-connectivity of the data center network DCell , 2016, Discret. Appl. Math..

[4]  Shiying Wang,et al.  Conditional fault tolerance in a class of Cayley graphs , 2016, Int. J. Comput. Math..

[5]  Li Xu,et al.  The $t/k$ -Diagnosability of Star Graph Networks , 2015, IEEE Transactions on Computers.

[6]  Sun-Yuan Hsieh,et al.  Structural Properties and Conditional Diagnosability of Star Graphs by Using the PMC Model , 2014, IEEE Transactions on Parallel and Distributed Systems.

[7]  Jun-Ming Xu,et al.  Generalized measures for fault tolerance of star networks , 2014, Networks.

[8]  Shuming Zhou,et al.  Fault diagnosability of arrangement graphs , 2012, Inf. Sci..

[9]  Yuxing Yang,et al.  Conditional connectivity of star graph networks under embedding restriction , 2012, Inf. Sci..

[10]  Cheng-Kuan Lin,et al.  The g-good-neighbor conditional diagnosability of hypercube under PMC model , 2012, Appl. Math. Comput..

[11]  Sun-Yuan Hsieh,et al.  Edge-bipancyclicity of star graphs with faulty elements , 2011, Theor. Comput. Sci..

[12]  Shahram Latifi,et al.  Improving bounds on link failure tolerance of the star graph , 2010, Inf. Sci..

[13]  Jung-Sheng Fu,et al.  Fault-free longest paths in star networks with conditional link faults , 2009, Theor. Comput. Sci..

[14]  Zhao Zhang,et al.  A kind of conditional vertex connectivity of star graphs , 2009, Appl. Math. Lett..

[15]  Cheng-Kuan Lin,et al.  Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the Comparison Diagnosis Model , 2008, J. Interconnect. Networks.

[16]  Shahram Latifi,et al.  Robustness of star graph network under link failure , 2008, Inf. Sci..

[17]  Shahram Latifi,et al.  A study of fault tolerance in star graph , 2007, Inf. Process. Lett..

[18]  Sun-Yuan Hsieh,et al.  Embedding longest fault-free paths onto star graphs with more vertex faults , 2005, Theor. Comput. Sci..

[19]  Jimmy J. M. Tan,et al.  Conditional diagnosability measures for large multiprocessor systems , 2005, IEEE Transactions on Computers.

[20]  Shahram Latifi,et al.  Diagnosability of star graphs under the comparison diagnosis model , 2005, Inf. Process. Lett..

[21]  Jimmy J. M. Tan,et al.  Hyper hamiltonian laceability on edge fault star graph , 2004, Inf. Sci..

[22]  Adele A. Rescigno,et al.  Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security , 2001, Inf. Sci..

[23]  Shuo-Cheng Hu,et al.  Fault tolerance on star graphs , 1997, Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis.

[24]  Khaled Day,et al.  A Comparative Study of Topological Properties of Hypercubes and Star Graphs , 1994, IEEE Trans. Parallel Distributed Syst..

[25]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[26]  G. F. Sullivan,et al.  An O(t3 + |E|) Fault Identification Algorithm for Diagnosable Systems , 1988, IEEE Trans. Computers.

[27]  Gerald M. Masson,et al.  An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems , 1984, IEEE Transactions on Computers.

[28]  Miroslaw Malek,et al.  A comparison connection assignment for diagnosis of multiprocessor systems , 1980, ISCA '80.

[29]  S. Louis Hakimi,et al.  Characterization of Connection Assignment of Diagnosable Systems , 1974, IEEE Transactions on Computers.

[30]  GERNOT METZE,et al.  On the Connection Assignment Problem of Diagnosable Systems , 1967, IEEE Trans. Electron. Comput..