Constructing uniquely realizable graphs (Q393739)
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 6249849
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing uniquely realizable graphs |
scientific article; zbMATH DE number 6249849 |
Statements
Constructing uniquely realizable graphs (English)
0 references
24 January 2014
0 references
rigidity
0 references
graph colorability
0 references
semi-definite programming
0 references
graph realization problem
0 references
0 references
0 references
0.7776135206222534
0 references
0.7204562425613403
0 references
0.7169674634933472
0 references
0.7169674634933472
0 references
0.7104486227035522
0 references
