On the computational complexity of degenerate unit distance representations of graphs (Q3000515)
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 the computational complexity of degenerate unit distance representations of graphs |
scientific article; zbMATH DE number 5897220
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of degenerate unit distance representations of graphs |
scientific article; zbMATH DE number 5897220 |
Statements
On the Computational Complexity of Degenerate Unit Distance Representations of Graphs (English)
0 references
19 May 2011
0 references
0.7915316820144653
0 references
0.7724298238754272
0 references
0.7621372938156128
0 references
0.7550680637359619
0 references
0.7488048076629639
0 references
