Optimal quantitative group testing on cycles and paths

DOI10.1016/S0166-218X(01)00188-3zbMATH Open1001.68090OpenAlexW1993963490WikidataQ128132412 ScholiaQ128132412MaRDI QIDQ5951973FDOQ5951973

Authors: Frank K. Hwang, J. S. Lee 

Publication date: 2001

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00188-3

Recommendations

• A search problem on graphs which generalizes some group testing problems with two defectives
• Optimal Two-Stage Algorithms for Group Testing Problems
• A tight upper bound for group testing in graphs
• Searching for an edge in a graph with restricted test sets
• Group testing in graphs

zbMATH Keywords

group tests

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• Search problems on graphs

This page was built for publication: Optimal quantitative group testing on cycles and paths

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