Path covering problems and testing of printed circuits

DOI10.1016/0166-218X(94)00142-ZzbMath0833.68064MaRDI QIDQ1900134

Francesco Mason, Giovanni Andreatta

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)

Related Items (1)

Vertex covering by paths on trees with its applications in machine translation

Cites Work

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

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