|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Fault Diagnosis as a Graph Coloring Problem
July 1974 (vol. 23 no. 7)
pp. 706-713
| ASCII Text | x | ||
| S.B. Akers, "Fault Diagnosis as a Graph Coloring Problem," IEEE Transactions on Computers, vol. 23, no. 7, pp. 706-713, July, 1974. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1974.224018, author = {S.B. Akers}, title = {Fault Diagnosis as a Graph Coloring Problem}, journal ={IEEE Transactions on Computers}, volume = {23}, number = {7}, issn = {0018-9340}, year = {1974}, pages = {706-713}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1974.224018}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Fault Diagnosis as a Graph Coloring Problem IS - 7 SN - 0018-9340 SP706 EP713 EPD - 706-713 A1 - S.B. Akers, PY - 1974 KW - Exercising sets KW - fault diagnosis KW - graph coloring KW - sensitizing paths KW - test sets. VL - 23 JA - IEEE Transactions on Computers ER - | |||
A method is presented for converting problems in fault diagnosis into ones involving coloring (labeling) the nodes of a graph. It is shown that many concepts and results of graph theory have direct counterparts in fault diagnosis. Specific fault diagnosis problems examined include exercising tests, fanout free networks, test point insertion, sensitized paths, and fault test generation. A number of examples are included.
Index Terms:
Exercising sets, fault diagnosis, graph coloring, sensitizing paths, test sets.
Citation:
S.B. Akers, "Fault Diagnosis as a Graph Coloring Problem," IEEE Transactions on Computers, vol. 23, no. 7, pp. 706-713, July 1974, doi:10.1109/T-C.1974.224018
Usage of this product signifies your acceptance of the Terms of Use.