On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On complexity of multidistance graph recognition in \(\mathbb{R}^1\) |
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
