Path covering problems and testing of printed circuits

DOI10.1016/0166-218X(94)00142-ZzbMATH Open0833.68064MaRDI QIDQ1900134FDOQ1900134

Authors: Giovanni Andreatta, Francesco Mason 

Publication date: 17 October 1995

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

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

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)

Cites Work

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

Cited In (8)

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

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)