Enviar artigo por via de e-mail On the distance and multidistance graph embeddability problem
- Autores: Tikhomirov M.I.1
-
Afiliações:
- Moscow Institute of Physics and Technology (State University)
- Edição: Volume 93, Nº 3 (2016)
- Páginas: 280-281
- Seção: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/223725
- DOI: https://doi.org/10.1134/S1064562416030121
- ID: 223725
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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.
Sobre autores
M. Tikhomirov
Moscow Institute of Physics and Technology (State University)
Autor responsável pela correspondência
Email: endagorion@gmail.com
Rússia, Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700
Arquivos suplementares
