Identifying defective network components through restricted group testing

DOI10.1007/S12597-019-00382-3MaRDI QIDQ2329566zbMATH OpenOpenAlexFDO

Authors Diptesh Ghosh

Publication date 18 October 2019

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12597-019-00382-3

zbMATH Keywords

\(s\)-\(t\) cutsgroup testingheuristicsnode coveringswitch networks

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An efficient randomized group testing procedure to determine the number of defectives
• Modifications of Competitive Group Testing
• When is individual testing optimal for nonadaptive group testing?
• scientific article; zbMATH DE number 1200215
• A revised algorithm for searching for all defective edges in a graph

Cites work

• A Sequential Method for Screening Experimental Variables
• Graph-Constrained Group Testing
• scientific article; zbMATH DE number 3831842 (Why is no real title available?)
• scientific article; zbMATH DE number 1508646 (Why is no real title available?)
• scientific article; zbMATH DE number 956611 (Why is no real title available?)
• Minimal cut cover of a graph with an application to the testing of electronic boards
• The minimum cut cover problem

This page was built for publication: Identifying defective network components through restricted group testing

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