Searching for faulty leaves in binary trees

DOI10.1007/3-540-60618-1_81MaRDI QIDQ6122230

Peter Damaschke

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cites Work

• Unnamed Item
• Group testing with two defectives
• A tight upper bound for group testing in graphs
• A parallel algorithm for nearly optimal edge search
• Edge search in graphs and hypergraphs of bounded rank
• A group testing problem for hypergraphs of bounded rank

This page was built for publication: Searching for faulty leaves in binary trees