Email this article On the distance and multidistance graph embeddability problem
- Authors: Tikhomirov M.I.1
-
Affiliations:
- Moscow Institute of Physics and Technology (State University)
- Issue: Vol 93, No 3 (2016)
- Pages: 280-281
- Section: Mathematics
- URL: https://journal-vniispk.ru/1064-5624/article/view/223725
- DOI: https://doi.org/10.1134/S1064562416030121
- ID: 223725
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
M. I. Tikhomirov
Moscow Institute of Physics and Technology (State University)
Author for correspondence.
Email: endagorion@gmail.com
Russian Federation, Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700
Supplementary files
