A parallel algorithm for nearly optimal edge search

DOI10.1016/0020-0190(95)00139-4MaRDI QIDQ1350305zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4087453
• A search problem on graphs which generalizes some group testing problems with two defectives
• scientific article; zbMATH DE number 4155927
• A fast parallel algorithm for the maximal independent set problem

Cites work

• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• A tight upper bound for group testing in graphs
• Edge search in graphs and hypergraphs of bounded rank
• Realizability and uniqueness in graphs

Cited in

(6)

• scientific article; zbMATH DE number 109188 (Why is no real title available?)
• scientific article; zbMATH DE number 3958744 (Why is no real title available?)
• On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors
• On the Wimer method for designing edge-based algorithms
• Improved algorithms for group testing with inhibitors
• Searching for faulty leaves in binary trees

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

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