Algebraic methods for counting Euclidean embeddings of rigid graphs (Q3557877)
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 5702331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algebraic methods for counting Euclidean embeddings of rigid graphs |
scientific article; zbMATH DE number 5702331 |
Statements
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs (English)
0 references
27 April 2010
0 references
rigid graph
0 references
Euclidean embedding
0 references
Henneberg construction
0 references
polynomial system
0 references
root bound
0 references
cyclohexane caterpillar
0 references
0.939086139202118
0 references
0.8805612921714783
0 references
0.8762211799621582
0 references
0.8635578155517578
0 references
0.8614440560340881
0 references
