On computational complexity of length embeddability of graphs (Q2629266): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2016.05.011 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2016.05.011 / rank | |||
Normal rank | |||
Latest revision as of 11:13, 19 December 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
