A competitive algorithm to find all defective edges in a graph

DOI10.1016/j.dam.2005.02.010zbMath1085.68111OpenAlexW1993987876MaRDI QIDQ2486071

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 theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

A competitive algorithm in searching for many edges in a hypergraph ⋮ A revised algorithm for searching for all defective edges in a graph

Cites Work

• Unnamed Item
• Search problems on graphs
• A tight upper bound for group testing in graphs
• A group testing problem for graphs with several defective edges
• A group testing problem for hypergraphs of bounded rank
• A Group Testing Problem

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