A parallel algorithm for nearly optimal edge search

DOI10.1016/0020-0190(95)00139-4zbMath0875.68505OpenAlexW2000497742MaRDI QIDQ1350305

Peter Damaschke

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00139-4

zbMATH Keywords

Parallel algorithmsNearly optimal edge search

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Related Items (2)

Improved algorithms for group testing with inhibitors ⋮ Searching for faulty leaves in binary trees

Cites Work

• Unnamed Item
• A tight upper bound for group testing in graphs
• Realizability and uniqueness in graphs
• Edge search in graphs and hypergraphs of bounded rank

This page was built for publication: A parallel algorithm for nearly optimal edge search