Non-adaptive group testing on graphs with connectivity

DOI10.1007/S10878-019-00379-0zbMATH Open1425.90098OpenAlexW2910986390WikidataQ128577332 ScholiaQ128577332MaRDI QIDQ2424809FDOQ2424809

Authors: Song Luo, Yuji Matsuura, Ying Miao, Maiko Shigeno 

Publication date: 25 June 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00379-0

Recommendations

• Comments on ``Nonadaptive group testing based on sparse pooling graphs
• A tight upper bound for group testing in graphs
• Non-adaptive group testing on graphs
• When is individual testing optimal for nonadaptive group testing?
• A group testing problem for graphs with several defective edges

zbMATH Keywords

group testingcomplete graphnon-adaptive schemetorus grid graph

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Nonrandom binary superimposed codes
• Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
• Graph-Constrained Group Testing

Cited In (4)

• Nonadaptive Group Testing Based on Sparse Pooling Graphs
• Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
• Comments on ``Nonadaptive group testing based on sparse pooling graphs
• Non-adaptive group testing on graphs

This page was built for publication: Non-adaptive group testing on graphs with connectivity

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