scientific article; zbMATH DE number 7650113

DOI10.4230/LIPICS.APPROX-RANDOM.2019.46MaRDI QIDQ5875503zbMATH OpenFDO

Authors Bruce Spang, Mary Wootters

Publication date 3 February 2023

Full work available at URL https://arxiv.org/abs/1809.03589

zbMATH Keywords

group testingnetwork tomographyrandom graphs

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cites work

• Expander graphs and their applications
• Explicit Non-adaptive Combinatorial Group Testing Schemes
• Graph-Constrained Group Testing
• scientific article; zbMATH DE number 1003274 (Why is no real title available?)
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 1508646 (Why is no real title available?)
• scientific article; zbMATH DE number 3801449 (Why is no real title available?)
• scientific article; zbMATH DE number 7378741 (Why is no real title available?)
• Largest random component of a k-cube
• Matching, Euler tours and the Chinese postman
• Network Tomography of Binary Network Performance Characteristics
• Network tomography: recent developments
• On the upper bound of the size of the \(r\)-cover-free families
• The emergence of a giant component in random subgraphs of pseudo-random graphs
• The phase transition in random graphs: a simple proof
• The Volume of the Giant Component of a Random Graph with Given Expected Degrees

Cited in

(5)

• Group testing in bipartite graphs
• A group testing problem for hypergraphs of bounded rank
• Nonadaptive Group Testing Based on Sparse Pooling Graphs
• Unconstraining graph-constrained group testing
• Optimal Dorfman group testing for symmetric distributions

This page was built for publication:

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