Optimal Reconstruction of Graphs under the Additive Model - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Algorithmica Year : 2000

Optimal Reconstruction of Graphs under the Additive Model

Abstract

We study the problem of reconstructing unknown graphs under the additive combinatorial search model. The main result concerns the reconstruction of {\em bounded degree} \/graphs, i.e.\ graphs with the degree of all vertices bounded by a constant $d$. We show that such graphs can be reconstructed in $O(dn)$ non--adaptive queries, which matches the information--theoretic lower bound. The proof is based on the technique of se\-pa\-rating matrices. A central result here is a new upper bound for a general class of separating matrices. As a particular case, we obtain a tight upper bound for the class of $d$--separating matrices, which settles an open question stated by Lindström in~\cite{Lindstrom75}. Finally, we consider several particular classes of graphs. We show how an optimal non--adaptive solution of $O(n^2/\log n)$ queries for general graphs can be obtained. We also prove that trees with unbounded vertex degree can be reconstructed in a linear number of queries by a non--adaptive algorithm.
No file

Dates and versions

inria-00099091 , version 1 (26-09-2006)

Identifiers

Cite

Vladimir Grebinski, Gregory Kucherov. Optimal Reconstruction of Graphs under the Additive Model. Algorithmica, 2000, 28 (1), pp.104-124. ⟨10.1007/s004530010033⟩. ⟨inria-00099091⟩
57 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More