A group testing problem for hypergraphs of bounded rank

Discrete Applied Mathematics

Volumn 66, Issue 2, 1996, Pages 185-188

  Triesch, Eberhard ^a  

^a Forschungsinstitut fur Diskrete Mathematik   (Germany)

Author keywords

Group testing; Hypergraphs; Kraft's inequality; Search problems

Indexed keywords

EID: 0041673879     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00120-G     Document Type: Article

References (7)

1. R. Ahlswede and I. Wegener, Suchprobleme (Teubner, Stuttgart, 1979).
2. M. Aigner, Combinatorial Search (Wiley, Chichester; Teubner, Stuttgart, 1988).
3. I. Althöfer, Edge search in graphs and hypergraphs of bounded rank: average search lengths in the weighted case, Preprint 93-069 of the SFB 343 "Diskrete Strukturen in der Mathematik", Bielefeld (1993).
4. I. Althöfer and M. Löwe, Edge search in graphs and hypergraphs, Preprint (1994).
5. I. Althöfer and E. Triesch, Edge search in graphs and hypergraphs of bounded rank, Discrete Math. 115 (1993) 1-9.
6. P. Damaschke, A tight upper bound for group testing in graphs, Discrete Appl. Math. 48 (1994) 101-109.
7. D.Z. Du and RK. Hwang, Combinatorial Group Testing and its Applications (World Scientific, Singapore, 1993).