Note: A competitive algorithm in searching for many edges in a hypergraph

Authors:
Ting Chen;Frank K. Hwang
Affiliations:
College of Statistics and Mathematics, Zhejiang Gongshang University, Hangzhou, PR China;Department of Applied Mathematics, National Chiaotung University, Hsinchu, Taiwan, ROC 1
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 4
Cited 2

Combinatorial search

Combinatorial search
A tight upper bound for group testing in graphs

Discrete Applied Mathematics
A group testing problem for hypergraphs of bounded rank

Discrete Applied Mathematics
A competitive algorithm to find all defective edges in a graph

Discrete Applied Mathematics

Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing

Theoretical Computer Science

Quantified Score

Hi-index	0.05

Visualization

Abstract

We give a competitive algorithm to identify all d defective edges in a hypergraph with d unknown. Damaschke did the d=1 case for 2-graphs, Triesch extended the d=1 case to r-graphs, and Johann did the general d case for 2-graphs. So ours is the first attempt to solve the searching for defective edges problem in its full generality. Further, all the above three papers assumed d known. We give a competitive algorithm where d is unknown.