Edge search in graphs and hypergraphs of bounded rank

DOI10.1016/0012-365X(93)90473-7zbMath0772.05090MaRDI QIDQ1801680

Ingo Althöfer, Eberhard Triesch

Publication date: 20 June 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

hypergraphsworst-case complexitytests

Mathematics Subject Classification ID

Searching and sorting (68P10) Hypergraphs (05C65) Graph theory (05C99)

Related Items (6)

Realizability and uniqueness in graphs ⋮ A parallel algorithm for nearly optimal edge search ⋮ Edge search in hypergraphs ⋮ A group testing problem for hypergraphs of bounded rank ⋮ Searching for faulty leaves in binary trees ⋮ Group testing in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Search problems on graphs
• Group testing with two defectives
• A search problem on graphs which generalizes some group testing problems with two defectives
• A Group Testing Problem on Two Disjoint Sets

This page was built for publication: Edge search in graphs and hypergraphs of bounded rank