By Topic

Fault Diagnosis as a Graph Coloring Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Akers, Sheldon B. ; Electronics Laboratory, General Electric Company

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.

Published in:

Computers, IEEE Transactions on  (Volume:C-23 ,  Issue: 7 )