A competitive algorithm in searching for many edges in a hypergraph

DOI10.1016/J.DAM.2006.07.008zbMATH Open1109.68124OpenAlexW1965118588MaRDI QIDQ869578FDOQ869578

Frank K. Hwang, Ting Chen

Publication date: 8 March 2007

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

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

zbMATH Keywords

group testinghypergraphgraph searchingcompetitive algorithmedge-searching problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Hypergraphs (05C65)

Cites Work

• Title not available (Why is that?)
• Competitive group testing
• A group testing problem for hypergraphs of bounded rank
• A group testing problem for graphs with several defective edges
• Sets pooling designs
• A tight upper bound for group testing in graphs
• A competitive algorithm to find all defective edges in a graph
• A Group Testing Problem on Two Disjoint Sets

Cited In (2)

• Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
• Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing

   Recommendations

• A competitive algorithm to find all defective edges in a graph 👍 👎
• A revised algorithm for searching for all defective edges in a graph 👍 👎
• A group testing problem for graphs with several defective edges 👍 👎
• Edge search in graphs and hypergraphs of bounded rank 👍 👎
• Competitive group testing 👍 👎

This page was built for publication: A competitive algorithm in searching for many edges in a hypergraph

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