Path covering problems and testing of printed circuits

DOI10.1016/0166-218X(94)00142-ZMaRDI QIDQ1900134zbMATH OpenFDO

Authors Giovanni Andreatta, Francesco Mason

Publication date 17 October 1995

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

path coveringprinted circuit testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Minimal cut cover of a graph with an application to the testing of electronic boards
• On the computational complexity of path cover problems
• Approximation algorithms for the test cover problem
• scientific article; zbMATH DE number 3929052

Cites work

• scientific article; zbMATH DE number 3887733 (Why is no real title available?)
• scientific article; zbMATH DE number 3717365 (Why is no real title available?)
• scientific article; zbMATH DE number 3467157 (Why is no real title available?)
• scientific article; zbMATH DE number 3550741 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• scientific article; zbMATH DE number 3353324 (Why is no real title available?)
• scientific article; zbMATH DE number 3404271 (Why is no real title available?)
• Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight
• COVERING AND PACKING IN GRAPHS, I.
• Covering and packing in graphs IV: Linear arboricity
• Minimal cut cover of a graph with an application to the testing of electronic boards
• NP-completeness of some problems of partitioning and covering in graphs
• On Path Cover Problems in Digraphs and Applications to Program Testing
• On mapping processes to processors in distributed systems
• On the computational complexity of path cover problems
• Path decompositions of digraphs
• Path decompositions of digraphs
• Path number and bipartite digraphs
• Path numbers of tournaments
• Recouvrement et partition en chaînes des arêtes d'un graphe cubique
• The edge intersection graphs of paths in a tree
• The linear arboricity of some regular graphs

Cited in

(8)

• scientific article; zbMATH DE number 3877104 (Why is no real title available?)
• A note on the minimum cut cover of graphs
• Distance-based covering problems for graphs of given cyclomatic number
• Vertex covering by paths on trees with its applications in machine translation
• Parameterizing path partitions
• Path testing in circuits with functional units
• On graphs coverable by \({k}\) shortest paths
• Vertex packing problem application to the design of electronic testing fixtures

This page was built for publication: Path covering problems and testing of printed circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900134)