On the distance and multidistance graph embeddability problem
Mikhail Tikhomirov · Doklady Mathematics · 2016
The notions of the distance and multidistance embeddability of a graph in ℝ d are natural generalizations of the notion of a distance graph in ℝ d . Results on the complexity of the computational problem of verifying distance graph embeddability are briefly surveyed, and new progress in solving this and related problems is described.