A competitive algorithm in searching for many edges in a hypergraph

DOI10.1016/j.dam.2006.07.008zbMath1109.68124OpenAlexW1965118588MaRDI QIDQ869578

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

hypergraphgroup testinggraph searchingcompetitive algorithmedge-searching problem

Mathematics Subject Classification ID

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

Related Items (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

Cites Work

• Unnamed Item
• Sets pooling designs
• Competitive group testing
• 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 competitive algorithm to find all defective edges in a graph
• A Group Testing Problem on Two Disjoint Sets

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