A competitive algorithm to find all defective edges in a graph

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.1016/J.DAM.2005.02.010" rel="nofollow">DOI 10.1016/J.DAM.2005.02.010</a><a class="pub-badge pub-badge--grey" href="https://zbmath.org/1085.68111" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--grey" href="https://openalex.org/works/W1993987876" rel="nofollow">OpenAlex</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q2486071" rel="nofollow">MaRDI QID Q2486071</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q2486071" rel="nofollow">FDO</a>

Authors Frank K. Hwang

Publication date 5 August 2005

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

Full work available at URL https://doi.org/10.1016/j.dam.2005.02.010

zbMATH Keywords

Competitive algorithmGroup testingGraph testing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A group testing problem for graphs with several defective edges
• Modifications of Competitive Group Testing
• A revised algorithm for searching for all defective edges in a graph
• A competitive algorithm in searching for many edges in a hypergraph
• Edge search in graphs with restricted test sets

Cites work

• scientific article; zbMATH DE number 1508646 (Why is no real title available?)
• A Group Testing Problem
• A group testing problem for graphs with several defective edges
• A group testing problem for hypergraphs of bounded rank
• A tight upper bound for group testing in graphs
• Search problems on graphs

Cited in

(3)

• A revised algorithm for searching for all defective edges in a graph
• A competitive algorithm in searching for many edges in a hypergraph
• A group testing problem for graphs with several defective edges

This page was built for publication: A competitive algorithm to find all defective edges in a graph

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