Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Polynomially Complete Fault Detection Problems
IEEE Transactions on Computers
Test Point Placement to Simplify Fault Detection
IEEE Transactions on Computers
An Approach to the Diagnosability Analysis of a System
IEEE Transactions on Computers
Structural Factors in the Fault Diagnosis of Combinational Networks
IEEE Transactions on Computers
Computer Diagnosis Using the Blocking Gate Approach
IEEE Transactions on Computers
System Fault Diagnosis: Closure and Diagnosability with Repair
IEEE Transactions on Computers
| Hi-index | 14.98 |
Consider a network which can be represented by an acyclic directed graph such that the links represented by the edges are subject to failure. Under the assumption that at most one link can fail at any time, we want to locate a failed link, if any, by means of certain tests. A test is performed by injecting a signal at a vertex and monitoring it at another vertex and can reveal if there is a failed link on any path between the two vertices. We want to find a minimal set of tests that can uniquely locate any single fault. Since this problem is in general NP-complete, we investigate a special case where the given network has a tree structure. We present an algorithm whose worst case running time can be bounded by a linear function of the input size.