Minimal cut cover of a graph with an application to the testing of electronic boards

DOI10.1016/0167-6377(92)90089-LzbMath0759.90093OpenAlexW1980958935MaRDI QIDQ1195870

Loulou, Richard

Publication date: 4 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90089-l

zbMATH Keywords

complete graphedge coveringprinted circuit boardsminimum cardinality cut covertesting for short circuits

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

A note on the minimum cut cover of graphs ⋮ On dependent randomized rounding algorithms ⋮ Path covering problems and testing of printed circuits ⋮ Edge cover by connected bipartite subgraphs ⋮ On fractional cut covers ⋮ The minimum cut cover problem ⋮ Minimum Scan Cover with Angular Transition Costs ⋮ Identifying defective network components through restricted group testing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal cut cover of a graph with an application to the testing of electronic boards