A search problem on graphs which generalizes some group testing problems with two defectives

DOI10.1016/0012-365X(91)90003-KzbMath0747.05042MaRDI QIDQ1176719

Thomas Andreae

Publication date: 25 June 1992

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

zbMATH Keywords

upper boundssearching

Mathematics Subject Classification ID

Searching and sorting (68P10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75)

Related Items (7)

An optimal group testing algorithm on \(k\) disjoint sets ⋮ Realizability and uniqueness in graphs ⋮ Game with Slow Pursuers on the Edge Graphs of Regular Simplexes ⋮ Differential Game with Slow Pursuers on the Edge Graph of a Simplex ⋮ A binary search problem on graphs ⋮ Edge search in graphs and hypergraphs of bounded rank ⋮ A pursuit-evasion differential game with slow pursuers on the edge graph of a simplex. I

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Search problems on graphs
• A ternary search problem on graphs
• Group testing with two defectives
• Axioms and hulls
• Topology of series-parallel networks
• Über eine Eigenschaft der ebenen Komplexe
• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
• A Group Testing Problem on Two Disjoint Sets
• On chromatic number of graphs and set-systems
• k-Degenerate Graphs

This page was built for publication: A search problem on graphs which generalizes some group testing problems with two defectives