Path covering problems and testing of printed circuits
This work deals with a problem, arising in the context of printed circuit testing, that will be formulated as a path covering problem on trees. For this problem, which consists in minimizing the number of continuity testing, an exact algorithm of linear complexity is here proposed for the first time...
Saved in:
| Published in | Discrete Applied Mathematics Vol. 62; no. 1; pp. 5 - 13 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
08.09.1995
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | This work deals with a problem, arising in the context of printed circuit testing, that will be formulated as a
path covering problem on trees. For this problem, which consists in minimizing the number of continuity testing, an exact algorithm of linear complexity is here proposed for the first time. A general classification of path covering problems is also presented and a brief review of the literature is given. |
|---|---|
| ISSN: | 0166-218X 1872-6771 |
| DOI: | 10.1016/0166-218X(94)00142-Z |