Almost Sure Fault Tolerance in Random Graphs

This publication has 9 references indexed in Scilit:

• An 0(n^2.5) Fault Identification Algorithm for Diagnosable Systems
  IEEE Transactions on Computers, 1984
• Vertices of given degree in a random graph
  Journal of Graph Theory, 1982
• Schemes for fault-tolerant computing: A comparison of modularly redundant and t-diagnosable systems
  Information and Control, 1981
• On Fault Identification in Diagnosable Systems
  IEEE Transactions on Computers, 1981
• General percolation and random graphs
  Advances in Applied Probability, 1981
• A diagnosing algorithm for networks
  Information and Control, 1975
• An Approach to the Diagnosability Analysis of a System
  IEEE Transactions on Computers, 1975
• Characterization of Connection Assignment of Diagnosable Systems
  IEEE Transactions on Computers, 1974
• On the Connection Assignment Problem of Diagnosable Systems
  IEEE Transactions on Electronic Computers, 1967