On computational complexity of length embeddability of graphs (Q2629266): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1410.5555 / rank | |||
Normal rank | |||
Revision as of 07:19, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On computational complexity of length embeddability of graphs |
scientific article |
Statements
On computational complexity of length embeddability of graphs (English)
0 references
5 July 2016
0 references
computational complexity
0 references
graph embedding
0 references
distance graph
0 references
