New upper bounds for the number of embeddings of minimally rigid graphs (Q2172653)
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 7585832
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New upper bounds for the number of embeddings of minimally rigid graphs |
scientific article; zbMATH DE number 7585832 |
Statements
New upper bounds for the number of embeddings of minimally rigid graphs (English)
0 references
16 September 2022
0 references
distance geometry
0 references
minimally rigid graph
0 references
rigid embedding
0 references
upper bound
0 references
Laman graph
0 references
oriented graph
0 references
0 references
0 references
0 references
0 references
0.9339239001274108
0 references
0.8918302059173584
0 references
0.8840335011482239
0 references
0.8762211799621582
0 references
0.8734021782875061
0 references
