Minimal cut cover of a graph with an application to the testing of electronic boards
type: Item
instance of: scholarly article
title: Minimal cut cover of a graph with an application to the testing of electronic boards
zbMATH Open document ID: 0759.90093
DOI: 10.1016/0167-6377(92)90089-L
published in: Operations Research Letters
publication date: 1993-01-04T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 86096
zbMATH Keywords: edge covering
zbMATH Keywords: testing for short circuits
zbMATH Keywords: printed circuit boards
zbMATH Keywords: minimum cardinality cut cover
zbMATH Keywords: complete graph
author: Richard Loulou
MaRDI profile type: Publication
cites work: Q4198056
cites work: Q5663904
cites work: Q3048571
cites work: Q3798484
full work available at URL: 0167-6377(92)90089-l
OpenAlex ID: W1980958935
Recommended article: A note on the minimum cut cover of graphs
Recommended article: Q4550498
Recommended article: Covering a graph with cuts of minimum total size
Recommended article: Q4487449
Recommended article: Min-max cover of a graph with a small number of parts
Recommended article: The minimum cut cover problem
Recommended article: Q4856276
Recommended article: An approximation of the minimum vertex cover in a graph
Recommended article: Covering the edges of a graph by circuits
Recommended article: Covering complete hypergraphs with cuts of minimum total size
description: scientific article; zbMATH DE number 86096