On the number of embeddings of minimally rigid graphs (Q4557533)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6984539
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of embeddings of minimally rigid graphs |
scientific article; zbMATH DE number 6984539 |
Statements
On the number of embeddings of minimally rigid graphs (English)
0 references
23 November 2018
0 references
Cayley-Menger variety
0 references
distance geometry
0 references
graph embedding
0 references
lower bound
0 references
rigidity
0 references
upper bound
0 references
0.9315496683120728
0 references
0.8908303380012512
0 references
0.8840335011482239
0 references
0.8805612921714783
0 references
