A group testing problem for hypergraphs of bounded rank
type: Item
instance of: scholarly article
title: A group testing problem for hypergraphs of bounded rank
zbMATH Open document ID: 0849.05055
DOI: 10.1016/0166-218X(95)00120-G
author: Eberhard Triesch
published in: Discrete Applied Mathematics
publication date: 1996-07-07T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 60C05
zbMATH DE Number: 897412
zbMATH Keywords: Kraft's inequality
zbMATH Keywords: hypergraph
zbMATH Keywords: probability distribution
zbMATH Keywords: group testing
MaRDI profile type: MaRDI publication profile
cites work: Q3861131
cites work: Q3994535
cites work: Edge search in graphs and hypergraphs of bounded rank
cites work: Edge search in hypergraphs
cites work: A tight upper bound for group testing in graphs
cites work: Q4857782
full work available at URL: 0166-218x(95)00120-g
OpenAlex ID: W2085062933
Recommended article: A tight upper bound for group testing in graphs
Recommended article: Group testing in bipartite graphs
Recommended article: Q3565935
Recommended article: Group testing in graphs
Recommended article: Graph-Constrained Group Testing
Recommended article: Group Testing Algorithms: Bounds and Simulations
Recommended article: A group testing problem for graphs with several defective edges
Recommended article: Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing
Recommended article: Q5875503
description: scientific article; zbMATH DE number 897412