On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:20, 5 March 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
