电邮这篇文章 On the distance and multidistance graph embeddability problem
- 作者: Tikhomirov M.I.1
-
隶属关系:
- Moscow Institute of Physics and Technology (State University)
- 期: 卷 93, 编号 3 (2016)
- 页面: 280-281
- 栏目: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/223725
- DOI: https://doi.org/10.1134/S1064562416030121
- ID: 223725
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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.
作者简介
M. Tikhomirov
Moscow Institute of Physics and Technology (State University)
编辑信件的主要联系方式.
Email: endagorion@gmail.com
俄罗斯联邦, Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700
补充文件
