Searching for faulty leaves in binary trees

DOI10.1007/3-540-60618-1_81MaRDI QIDQ6122230zbMATH OpenFDO

Authors Peter Damaschke

Publication date 28 February 2024

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

Full work available at URL https://doi.org/10.1007/3-540-60618-1_81

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)

Recommendations

• How to test a tree
• Prefix search with a lie
• Fast searching in trees
• Efficient VLSI fault simulation
• Diagnosis of Faults in Linear Tree Networks

Cites work

• A group testing problem for hypergraphs of bounded rank
• A parallel algorithm for nearly optimal edge search
• A tight upper bound for group testing in graphs
• Edge search in graphs and hypergraphs of bounded rank
• Group testing with two defectives
• scientific article; zbMATH DE number 41347 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6122230)