PATH COVERING PROBLEMS AND TESTING OF PRINTED-CIRCUITS

This work deals with a problem, arising in the context of printed circ uit testing, that will be formulated as a path covering problem on tre es. For this problem, which consists in minimizing the number of conti nuity testing, an exact algorithm of linear complexity is here propose d for the first time. A general classification of path covering proble ms is also presented and a brief review of the literature is given.