A competitive algorithm in searching for many edges in a hypergraph

DOI10.1016/J.DAM.2006.07.008MaRDI QIDQ869578zbMATH OpenOpenAlexFDO

Authors Ting Chen, Frank K. Hwang

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)

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

Cites work

• scientific article; zbMATH DE number 41347 (Why is no real title available?)
• A Group Testing Problem on Two Disjoint Sets
• A competitive algorithm to find all defective edges in a graph
• 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
• Competitive group testing
• Sets pooling designs

Cited in

(4)

• Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
• A revised algorithm for searching for all defective edges in a graph
• A competitive algorithm to find all defective edges in a graph
• Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex 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)