A competitive algorithm to find all defective edges in a graph

DOI10.1016/J.DAM.2005.02.010zbMATH Open1085.68111OpenAlexW1993987876MaRDI QIDQ2486071FDOQ2486071

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

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

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)

Cites Work

• A group testing problem for hypergraphs of bounded rank
• Title not available (Why is that?)
• Search problems on graphs
• A group testing problem for graphs with several defective edges
• A tight upper bound for group testing in graphs
• A Group Testing Problem

Cited In (3)

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

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)