# Optimal Query Complexity for Reconstructing Hypergraphs

Abstract : In this paper we consider the problem of reconstructing a hidden weighted hypergraph of constant rank using additive queries. We prove the following: Let $G$ be a weighted hidden hypergraph of constant rank with n vertices and $m$ hyperedges. For any $m$ there exists a non-adaptive algorithm that finds the edges of the graph and their weights using $O(\frac{m\log n}{\log m})$ additive queries. This solves the open problem in [S. Choi, J. H. Kim. Optimal Query Complexity Bounds for Finding Graphs. {\em STOC}, 749--758,~2008]. When the weights of the hypergraph are integers that are less than $O(poly(n^d/m))$ where $d$ is the rank of the hypergraph (and therefore for unweighted hypergraphs) there exists a non-adaptive algorithm that finds the edges of the graph and their weights using $O(\frac{m\log \frac{n^d}{m}}{\log m}).$ additive queries. Using the information theoretic bound the above query complexities are tight.
Document type :
Conference papers

Cited literature [23 references]

https://hal.inria.fr/inria-00455786
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Thursday, February 11, 2010 - 11:18:54 AM
Last modification on : Monday, February 22, 2010 - 10:50:25 AM
Long-term archiving on: : Friday, June 18, 2010 - 8:12:34 PM

### File

bshouty.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : inria-00455786, version 1

### Citation

Nader H. Bshouty, Hanna Mazzawi. Optimal Query Complexity for Reconstructing Hypergraphs. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.143-154. ⟨inria-00455786⟩

Record views