Improved bounds for group testing in arbitrary hypergraphs

DOI10.1007/978-3-031-92932-8_14MaRDI QIDQ6902194zbMATH OpenFDO

Authors Annalisa De Bonis

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92932-8_14

zbMATH Keywords

algorithmsgroup testinghypergraphslower boundsseparable codessuperimposed codes

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Born again group testing: Multiaccess communications
• Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing
• Exploring the missing link among d-separable, d-separable and d-disjunct matrices
• Families of finite sets in which no set is covered by the union of \(r\) others
• scientific article; zbMATH DE number 3831842 (Why is no real title available?)
• scientific article; zbMATH DE number 1848288 (Why is no real title available?)
• Learning a Hidden Subgraph
• Nonrandom binary superimposed codes
• On \(k\)-strong conflict-free multicoloring
• On the upper bound of the size of the \(r\)-cover-free families
• Optimal Two-Stage Algorithms for Group Testing Problems
• Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
• Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)

This page was built for publication: Improved bounds for group testing in arbitrary hypergraphs

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