Optimal Query Complexity for Reconstructing Hypergraphs

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

• Type: Conference
• Year: 2010
• Where: STACS
• Authors: Nader H. Bshouty, Hanna Mazzawi
• Keywords: STACS 2010, Theoretical Computer Science