Cuts, matrix completions and graph rigidity (Q1365058)
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 1053961
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cuts, matrix completions and graph rigidity |
scientific article; zbMATH DE number 1053961 |
Statements
Cuts, matrix completions and graph rigidity (English)
0 references
25 May 1998
0 references
polyhedral combinatorics
0 references
cut
0 references
semidefinite programming
0 references
Euclidean distance matrices
0 references
matrix completion
0 references
graph realization problem
0 references
graph rigidity
0 references
0 references
0 references
0.8880507
0 references
0.8868461
0 references
0 references
0.8831327
0 references
0 references
0.8806174
0 references
0 references
0.8784298
0 references
