On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.endm.2017.07.070 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ENDM.2017.07.070 / rank | |||
Normal rank | |||
Latest revision as of 03:53, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On complexity of multidistance graph recognition in \(\mathbb{R}^1\) |
scientific article |
Statements
On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (English)
0 references
18 January 2018
0 references
computational complexity
0 references
geometric graphs
0 references
graph homomorphism
0 references
Cayley graphs
0 references
0 references
