Reconstruction in one dimension from unlabeled Euclidean lengths

Robert Connelly, Steven J. Gortler, Louis Theran

Let $G$ be a $3$-connected ordered graph with $n$ vertices and $m$ edges. Let $\mathbf{p}$ be a randomly chosen mapping of these $n$ vertices to the integer range $\{1, 2,3, \ldots…