Pages that link to "Item:Q3581591"
From MaRDI portal
The following pages link to A semidefinite programming approach to tensegrity theory and realizability of graphs (Q3581591):
Displaying 8 items.
- On bar frameworks, stress matrices and semidefinite programming (Q717126) (← links)
- On stress matrices of \((d + 1)\)-lateration frameworks in general position (Q1942275) (← links)
- A new graph parameter related to bounded rank positive semidefinite matrix completions (Q2248754) (← links)
- Iterative universal rigidity (Q2351022) (← links)
- Characterizing graphs with convex and connected Cayley configuration spaces (Q2380778) (← links)
- Euclidean Distance Matrices and Applications (Q2802549) (← links)
- Selected Open Problems in Discrete Geometry and Optimization (Q2849006) (← links)
- Low-Distortion Inference of Latent Similarities from a Multiplex Social Network (Q5255011) (← links)