Reconstruction of hidden graphs and threshold group testing

  • Authors:

  • Huilan Chang;Hong-Bin Chen;Hung-Lin Fu;Chie-Huai Shi

  • Affiliations:

  • Department of Applied Mathematics, National Chiao Tung University, Hsinchu, Taiwan 30010;Department of Applied Mathematics, National Chiao Tung University, Hsinchu, Taiwan 30010;Department of Applied Mathematics, National Chiao Tung University, Hsinchu, Taiwan 30010;Department of Applied Mathematics, National Chiao Tung University, Hsinchu, Taiwan 30010

  • Venue:
  • Journal of Combinatorial Optimization
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Classical group testing is a search paradigm where the goal is the identification of individual positive elements in a large collection of elements by asking queries of the form "Does a set of elements contain a positive one?". A graph reconstruction problem that generalizes the classical group testing problem is to reconstruct a hidden graph from a given family of graphs by asking queries of the form "Whether a set of vertices induces an edge". Reconstruction problems on families of Hamiltonian cycles, matchings, stars and cliques on n vertices have been studied where algorithms of using at most 2nlg驴n,(1+o(1))(nlg驴n),2n and 2n queries were proposed, respectively. In this paper we improve them to $(1+o(1))(n\lg n),(1+o(1))(\frac{n\lg n}{2}),n+2\lg n$ and n+lg驴n, respectively. Threshold group testing is another generalization of group testing which is to identify the individual positive elements in a collection of elements under a more general setting, in which there are two fixed thresholds 驴 and u, with 驴u, and the response to a query is positive if the tested subset of elements contains at least u positive elements, negative if it contains at most 驴 positive elements, and it is arbitrarily given otherwise. For the threshold group testing problem with 驴=u驴1, we show that p positive elements among n given elements can be determined by using O(plg驴n) queries, with a matching lower bound.